Total 2-cut complexes of powers of cycle graphs and Cartesian products of certain graphs
Abstract
For a positive integer k, the total k-cut complex of a graph G, denoted as kt(G), is the simplicial complex whose facets are σ ⊂eq V(G) such that |σ| = |V(G)|-k and the induced subgraph G[V(G) σ] does not contain any edge. These complexes were introduced by Bayer et al.\ in Bayer2024TotalCutcomplex in connection with commutative algebra. In the same paper, they studied the homotopy types of these complexes for various families of graphs, including cycle graphs Cn, squared cycle graphs Cn2, and Cartesian products of complete graphs and path graphs Km P2 and K2 Pn. In this article, we extend the work of Bayer et al.\ for these families of graphs. We focus on the complexes 2t(G) and determine the homotopy types of these complexes for three classes of graphs: (i) p-th powers of cycle graphs Cnp (ii) Km Pn and (iii) Km Cn. Using discrete Morse theory, we show that these complexes are homotopy equivalent to wedges of spheres. We also give the number and dimension of spheres appearing in the homotopy type. Our result on powers of cycle graphs Cnp proves a conjecture of Shen et al.\ about the homotopy type of the complexes 2t(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.