Total $2$-cut complexes of powers of cycle graphs and Cartesian products of certain graphs
Abstract
For a positive integer , the \emph{ total -cut complex} of a graph , denoted as , is the simplicial complex whose facets are such that and the induced subgraph does not contain any edge. These complexes were introduced by Bayer et al.\ in \cite{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 , squared cycle graphs , and Cartesian products of complete graphs and path graphs and . In this article, we extend the work of Bayer et al.\ for these families of graphs. We focus on the complexes and determine the homotopy types of these complexes for three classes of graphs: (i) -th powers of cycle graphs (ii) and (iii) . 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 proves a conjecture of Shen et al.\ about the homotopy type of the complexes .
Cite
@article{arxiv.2512.04486,
title = {Total $2$-cut complexes of powers of cycle graphs and Cartesian products of certain graphs},
author = {Pratiksha Chauhan and Samir Shukla and Kumar Vinayak},
journal= {arXiv preprint arXiv:2512.04486},
year = {2025}
}
Comments
16 pages