Topology of Cut Complexes II

Abstract

We continue the study of the $k$-cut complex ${\Delta }_k(G)$ of a graph $G$ initiated in the paper of Bayer, Denker, Jelić Milutinović, Rowlands, Sundaram and Xue [Topology of cut complexes of graphs, SIAM J. on Discrete Math. 38(2): 1630--1675 (2024)]. We give explicit formulas for the $f$- and $h$-polynomials of the cut complex ${\Delta }_k(G_1+G_2)$ of the disjoint union of two graphs $G_1$ and $G_2$, and for the homology representation of ${\Delta }_k(K_m+K_n)$. We also study the cut complex of the squared path and the grid graph. Our techniques include tools from combinatorial topology, discrete Morse theory and equivariant poset topology.

arXiv comment29 pages, 7 figures, 3 tables

References in corpus (2)

• Total Cut Complexes of Graphs
• Topology of Cut Complexes of Graphs