Algebraic properties of edge ideals via combinatorial topology.
Dochtermann, Anton, Engström, Alexander (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On Stanley-Reisner rings of reduction number one”
Algebraic properties of edge ideals via combinatorial topology.
Fixed simplex property for retractable complexes.
Idzik, Adam, Zapart, Anna (2010)
Fixed Point Theory and Applications [electronic only]
Similarity:
A uniform approach to complexes arising from forests.
Marietti, Mario, Testa, Damiano (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Stanley-Reisner rings
Ralf Fröberg (1990)
Banach Center Publications
Similarity:
Shellability and the strong gcd-condition.
Berglund, Alexander (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A combinatorial proof of a formula for Betti numbers of a stacked polytope.
Choi, Suyoung, Kim, Jang Soo (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On 3-simplicial vertices in planar graphs
Endre Boros, Robert E. Jamison, Renu Laskar, Henry Martyn Mulder (2004)
Discussiones Mathematicae Graph Theory
Similarity:
A vertex v in a graph G = (V,E) is k-simplicial if the neighborhood N(v) of v can be vertex-covered by k or fewer complete graphs. The main result of the paper states that a planar graph of order at least four has at least four 3-simplicial vertices of degree at most five. This result is a strengthening of the classical corollary of Euler's Formula that a planar graph of order at least four contains at least four vertices of degree at most five.
Finding a spanning tree of a graph with maximal number of terminal vertices
Bohdan Zelinka (1973)
Kybernetika
Similarity:
Embedding a forest in a graph.
Goldberg, Mark K., Magdon-Ismail, Malik (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Face vectors of two-dimensional Buchsbaum complexes.
Murai, Satoshi (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An equivalence criterion for 3-manifolds.
M. R. Casali (1997)
Revista Matemática de la Universidad Complutense de Madrid
Similarity:
Within geometric topology of 3-manifolds (with or without boundary), a representation theory exists, which makes use of 4-coloured graphs. Aim of this paper is to translate the homeomorphism problem for the represented manifolds into an equivalence problem for 4-coloured graphs, by means of a finite number of graph-moves, called dipole moves. Moreover, interesting consequences are obtained, which are related with the same problem in the n-dimensional setting.