Total Cut Complexes of Graphs

MaRDI QIDQ6506672arXivFDO

Authors Margaret M. Bayer, Mark Denker, Marija Jelić Milutinović, Rowan Rowlands, Sheila Sundaram, Lei Xue

Published in arXiv

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of simplicial complexes (05E45) Relations of low-dimensional topology with graph theory (57M15) Discrete Morse theory and related ideas in manifold topology (57Q70)

Abstract: We define the total $k$-cut complex of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the homotopy types and combinatorial properties of total cut complexes for various families of graphs, including chordal graphs, cycles, bipartite graphs, the prism $K_{n}imes{K}_2$, and grid graphs, using techniques from algebraic topology and discrete Morse theory.

This page was built for publication: Total Cut Complexes of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6506672)