Shellability of 3-cut complexes of powers of cycle graphs
Pratiksha Chauhan, Samir Shukla

TL;DR
This paper proves that the 3-cut complexes of powers of cycle graphs are shellable for sufficiently large n, providing explicit shellings, and characterizes their homotopy types as wedges of spheres.
Contribution
It establishes shellability of 3-cut complexes of power cycle graphs, offers explicit shelling orders, and determines their homotopy types and sphere counts.
Findings
$ riangle_3(C_n^p)$ is shellable for $n \\geq 6p-3$.
The complexes are homotopy equivalent to wedges of spheres.
Explicit shelling orders and sphere counts are provided.
Abstract
In connection with commutative algebra, Bayer et al. introduced cut complexes in [Topology of cut complexes of graphs, SIAM J.\ Discrete Math., 38(2):1630-1675, 2024]. For a positive integer , the -cut complex of a graph , denoted as , is the simplicial complex whose facets are the -subsets of the vertex set of such that the induced subgraph is disconnected. Let denote the -th power graph of the cycle graph on vertices. In this article, we show that is shellable for , and therefore these complexes are homotopy equivalent to a wedge of spheres of dimension . We provide an explicit shelling order on the facets of . We also characterize and count the number of spanning facets in this shelling order, and determine the number of spheres…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Homotopy and Cohomology in Algebraic Topology · Advanced Combinatorial Mathematics
