Shellability of 3-cut complexes of powers of cycle graphs
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 k, the k-cut complex of a graph G, denoted as k(G), is the simplicial complex whose facets are the (|V(G)|-k)-subsets σ of the vertex set V(G) of G such that the induced subgraph G[V(G) σ] is disconnected. Let Cnp denote the p-th power graph of the cycle graph Cn on n vertices. In this article, we show that 3(Cnp) is shellable for n ≥ 6p-3, and therefore these complexes are homotopy equivalent to a wedge of spheres of dimension n-4. We provide an explicit shelling order on the facets of 3(Cnp). 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).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.