Cohen–Macaulayness conjecture for -co-connected complexes
Cohen–Macaulayness conjecture for -co-connected complexes
Let be a finite simple graph. For an integer , let denote its -co-connected complex, and let denote the associated -connected graph.
Cohen–Macaulayness conjecture. The complex is Cohen–Macaulay if and only if is co-chordal.
This conjecture proposes a characterization of Cohen–Macaulayness for -co-connected complexes in terms of the co-chordality of the associated -connected graph. The surrounding discussion gives examples and structural results for several graph classes, but does not establish the claimed equivalence in general.
Sources & referencesView supporting material
Primary source
Priyavrat Deshpande, Amit Roy and Rutuja Sawant, “The complex of r-co-connected subgraphs, chordality and Fröberg's theorem”, arXiv:2510.25710 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.