Bayer et al.'s shellability conjecture for cut complexes of grid graphs
Let denote the grid graph, and let be the -cut complex of a graph . A simplicial complex is shellable if its facets admit a shelling order. Bayer et al.'s shellability conjecture. The complex is shellable for all
This concerns the shellability of cut complexes across the full stated range of . The source says that Bayer et al. had already proved shellability for , while the displayed assertion is presented as their conjecture; no resolution of the full range is given here.
References
- Himanshu Chandrakar, Nisith Ranjan Hazra, Debotosh Rout and Anurag Singh, “Topology of total cut complexes and cut complexes of grid graphs”, arXiv:2408.07646 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.