Table of Contents
Fetching ...

Shellability of 3-cut complexes of powers of cycle graphs

Pratiksha Chauhan, Samir Shukla

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) \setminus σ]$ is disconnected. Let $C_n^p$ denote the $p$-th power graph of the cycle graph $C_n$ on $n$ vertices. In this article, we show that $Δ_3(C_n^p)$ is shellable for $n \geq 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(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(C_n^p)$.

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 , 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 appearing in the wedge in the homotopy type of .
Paper Structure (9 sections, 37 theorems, 14 equations)

This paper contains 9 sections, 37 theorems, 14 equations.

Key Result

Theorem 1.1

A Stanley–Reisner ideal $I_{\Delta}$ generated by quadratic square-free monomials has a $2$-linear resolution if and only if $\Delta$ is the clique complex $\mathsf{Cl}(G)$ of a chordal graph $G$.

Theorems & Definitions (79)

  • Theorem 1.1: Eagon1998, Froberg1990
  • Theorem 1.2: Eagon1998
  • Definition 1.3
  • Theorem 1.4
  • Definition 2.1
  • Definition 2.2: Kozlov2008
  • Theorem 2.3
  • Proposition 3.1
  • proof
  • Remark 3.2: Shellability2025
  • ...and 69 more