Regularity, matchings and Cameron-Walker graphs

DOI10.1007/s13348-019-00250-9zbMath1432.13017arXiv1809.05377OpenAlexW2963150361WikidataQ128007283 ScholiaQ128007283MaRDI QIDQ2301245

Tran Nam Trung

Publication date: 24 February 2020

Published in: Collectanea Mathematica (Search for Journal in Brave)

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

zbMATH Keywords

regularitymatchingedge idealCameron-Walker graph

Mathematics Subject Classification ID

Syzygies, resolutions, complexes and commutative rings (13D02) Combinatorial aspects of simplicial complexes (05E45) Combinatorial aspects of commutative algebra (05E40) Commutative rings defined by binomial ideals, toric rings, etc. (13F65)

Related Items

The regularity and h-polynomial of Cameron-Walker graphs ⋮ An upper bound for the regularity of symbolic powers of edge ideals of chordal graphs ⋮ Upper bounds for the regularity of powers of edge ideals of graphs ⋮ Induced matching numbers of finite graphs and edge ideals ⋮ Regularity and \(a\)-invariant of Cameron-Walker graphs ⋮ Maximal independent sets and regularity of graphs ⋮ Matching numbers and dimension of edge ideals ⋮ Matchings and squarefree powers of edge ideals ⋮ Homological invariants of Cameron–Walker Graphs ⋮ Regularity of edge ideals

Uses Software

• Macaulay2

Cites Work

• Bounds on the regularity and projective dimension of ideals associated to graphs
• Matchings, coverings, and Castelnuovo-Mumford regularity
• Algebraic study on Cameron-Walker graphs
• d-collapsing and nerves of families of convex sets
• Characteristic-independence of Betti numbers of graph ideals
• Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
• The graphs with maximum induced matching and maximum matching the same size
• Regularity of Squarefree Monomial Ideals
• Unnamed Item