Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
From MaRDI portal
Publication:405058
zbMath1305.13007arXiv1205.5631MaRDI QIDQ405058
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.5631
Castelnuovo-Mumford regularityinduced matchingcochordal cover numbercodismantlabilityCohen-Macaulay and sequentially Cohen-Macaulay graphsedge ringsvertex decomposable graphswell-covered graphs
Paths and cycles (05C38) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of commutative algebra (05E40)
Related Items
A note on independence complexes of chordal graphs and dismantling ⋮ On well-covered, vertex decomposable and Cohen-Macaulay graphs ⋮ The size of Betti tables of edge ideals of clique corona graphs ⋮ Edge-stable equimatchable graphs ⋮ A classification of 1-well-covered graphs ⋮ \(W_2\)-graphs and shedding vertices ⋮ Regularity of powers of bipartite graphs ⋮ Unnamed Item ⋮ Algebraic study on Cameron-Walker graphs ⋮ Prime graphs, matchings and the Castelnuovo-Mumford regularity ⋮ Improved bounds for the regularity of edge ideals of graphs ⋮ Codismantlability and projective dimension of the Stanley-Reisner ring of special hypergraphs ⋮ On vertex decomposable and Cohen-Macaulay regular graphs ⋮ Upper bounds for the regularity of powers of edge ideals of graphs ⋮ Induced matching numbers of finite graphs and edge ideals ⋮ Regularity and projective dimension of edge ideals ⋮ Regularity and \(a\)-invariant of Cameron-Walker graphs ⋮ Dominating induced matchings of finite graphs and regularity of edge ideals ⋮ Shedding vertices of vertex decomposable well-covered graphs ⋮ Regularity of bicyclic graphs and their powers ⋮ 1-well-covered graphs revisited ⋮ Regularity of powers of edge ideals of unicyclic graphs ⋮ The \(\text{v} \)-number of monomial ideals
Cites Work
- Unnamed Item
- Unnamed Item
- Matchings, coverings, and Castelnuovo-Mumford regularity
- Vertex decomposability and regularity of very well-covered graphs
- Progress in commutative algebra 1. Combinatorics and homology
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
- Algebraic properties of edge ideals via combinatorial topology
- Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity
- A characterization of well covered graphs of girth 5 or greater
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- Characteristic-independence of Betti numbers of graph ideals
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- Point determination in graphs
- Cohen–Macaulay Graphs and Face Vectors of Flag Complexes
- Vertex decomposable graphs and obstructions to shellability
- Sequentially Cohen-Macaulay edge ideals
- Edge Dominating Sets in Graphs
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- Graph Classes: A Survey
- Cohen-Macaulay edge ideal whose height is half of the number of vertices
- Combinatorics and commutative algebra
