English

Shellability of 3-cut complexes of powers of cycle graphs

Combinatorics 2026-03-25 v1 Algebraic Topology

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 kk, the kk-cut complex of a graph GG, denoted as Δk(G)\Delta_k(G), is the simplicial complex whose facets are the (V(G)k)(|V(G)|-k)-subsets σ\sigma of the vertex set V(G)V(G) of GG such that the induced subgraph G[V(G)σ]G[V(G) \setminus \sigma] is disconnected. Let CnpC_n^p denote the pp-th power graph of the cycle graph CnC_n on nn vertices. In this article, we show that Δ3(Cnp)\Delta_3(C_n^p) is shellable for n6p3n \geq 6p-3, and therefore these complexes are homotopy equivalent to a wedge of spheres of dimension n4n-4. We provide an explicit shelling order on the facets of Δ3(Cnp)\Delta_3(C_n^p). We also characterize and count the number of spanning facets in this shelling order, and determine the number of spheres appearing in the wedge in the homotopy type of Δ3(Cnp)\Delta_3(C_n^p).

Keywords

Cite

@article{arxiv.2603.23155,
  title  = {Shellability of 3-cut complexes of powers of cycle graphs},
  author = {Pratiksha Chauhan and Samir Shukla},
  journal= {arXiv preprint arXiv:2603.23155},
  year   = {2026}
}