Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/1648| Title: | Total Cut Complexes of Graphs | Authors: | Bayer, Margaret Denker, Mark Jelić Milutinović, Marija Rowlands, Rowan Sundaram, Sheila Xue, Lei |
Affiliations: | Topology | Keywords: | 05C69;05E45;57M15;57Q70;Chordal graph;Complex of graphs;Homotopy;Independent set;Morse matching;Simplicial vertex;Vertex decomposability | Issue Date: | 1-Jan-2024 | Rank: | M22 | Publisher: | Springer | Journal: | Discrete and Computational Geometry | Abstract: | Inspired by work of Fröberg (1990), and Eagon and Reiner (1998), 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 Kn×K2, and grid graphs, using techniques from algebraic topology and discrete Morse theory. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/1648 | ISSN: | 01795376 | DOI: | 10.1007/s00454-024-00630-4 |
| Appears in Collections: | Research outputs |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.