Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity

zbMATH Open1305.13007arXiv1205.5631MaRDI QIDQ405058FDOQ405058

Authors: Türker Bıyıkoğlu, Yusuf Civan 

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is well-covered and it lacks induced cycles of length four, five and seven, than the vertex decomposability, codismantlability and Cohen-Macaulayness for G are all equivalent. The rest deals with the computation of Castelnuovo-Mumford regularity of codismantlable graphs. Note that our approach complements and unifies many of the earlier results on bipartite, chordal and very well-covered graphs.

Full work available at URL: https://arxiv.org/abs/1205.5631

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Vertex decomposability and regularity of very well-covered graphs
• scientific article; zbMATH DE number 7660842
• On well-covered, vertex decomposable and Cohen-Macaulay graphs
• On vertex decomposable and Cohen-Macaulay regular graphs
• Prime graphs, matchings and the Castelnuovo-Mumford regularity

zbMATH Keywords

Castelnuovo-Mumford regularityinduced matchingcochordal cover numbercodismantlabilityCohen-Macaulay and sequentially Cohen-Macaulay graphsedge ringsvertex decomposable graphswell-covered graphs

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Cites Work

• A characterization of well covered graphs of girth 5 or greater
• Graph Classes: A Survey
• Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
• Sequentially Cohen-Macaulay edge ideals
• Title not available (Why is that?)
• Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
• Edge ideals: algebraic and combinatorial properties
• Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
• Cohen-Macaulay graphs and face vectors of flag complexes
• Algebraic properties of edge ideals via combinatorial topology
• Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity
• Vertex decomposable graphs and obstructions to shellability
• Cohen-Macaulay edge ideal whose height is half of the number of vertices
• Vertex decomposability and regularity of very well-covered graphs
• Edge Dominating Sets in Graphs
• Combinatorics and commutative algebra
• 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
• Title not available (Why is that?)
• Matchings, coverings, and Castelnuovo-Mumford regularity
• Characteristic-independence of Betti numbers of graph ideals
• Point determination in graphs

Cited In (29)

• A classification of 1-well-covered graphs
• A note on independence complexes of chordal graphs and dismantling
• Regularity and projective dimension of edge ideals
• Improved bounds for the regularity of edge ideals of graphs
• Upper bounds for the regularity of powers of edge ideals of graphs
• Regularity of powers of edge ideals of unicyclic graphs
• On well-covered, vertex decomposable and Cohen-Macaulay graphs
• Codismantlability and projective dimension of the Stanley-Reisner ring of special hypergraphs
• Vertex decomposability and regularity of very well-covered graphs
• The size of Betti tables of edge ideals of clique corona graphs
• Partial coloring, vertex decomposability and sequentially Cohen-Macaulay simplicial complexes
• Title not available (Why is that?)
• Regularity of bicyclic graphs and their powers
• Algebraic study on Cameron-Walker graphs
• Title not available (Why is that?)
• The \(\circ\) operation and \(*\) operation of Cohen-Macaulay bipartite graphs.
• \(W_2\)-graphs and shedding vertices
• A remark on sequentially Cohen-Macaulay monomial ideals
• On vertex decomposable and Cohen-Macaulay regular graphs
• 1-well-covered graphs containing a clique of size \(n/3\)
• The \(\text{v} \)-number of monomial ideals
• Induced matching numbers of finite graphs and edge ideals
• Regularity of powers of bipartite graphs
• Regularity and \(a\)-invariant of Cameron-Walker graphs
• Prime graphs, matchings and the Castelnuovo-Mumford regularity
• Shedding vertices of vertex decomposable well-covered graphs
• Edge-stable equimatchable graphs
• Dominating induced matchings of finite graphs and regularity of edge ideals
• 1-well-covered graphs revisited

This page was built for publication: Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405058)