Chordal graph conjecture for square-free powers
Chordal graph conjecture for square-free powers
Let be a chordal graph, let be its edge ideal, let denote its -th square-free power, let be its matching number, and let be its -admissible matching number. Chordal graph conjecture. For all , one has
The equality is known for block graphs and for when is Cohen–Macaulay and chordal; computations also support it for chordal graphs with at most eight vertices. The assertion remains open in general.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Trung Chau, Kanoy Kumar Das, Amit Roy and Kamalesh Saha, “Admissible matchings and the Castelnuovo-Mumford regularity of square-free powers”, arXiv:2504.11941 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.