Indivisibility for Classes of Graphs
Combinatorics
2025-04-09 v2 Logic
Abstract
We examine indivisibility for classes of graphs. We show that the class of hereditarily -sparse graphs is indivisible if and only if . Additionally, we show that the following classes of graphs are indivisible: perfect graphs, cographs, and chordal graphs, and the following classes of graphs are not indivisible: threshold graphs, split graphs, and distance-hereditary graphs.
Cite
@article{arxiv.2312.01466,
title = {Indivisibility for Classes of Graphs},
author = {Vince Guingona and Felix Nusbaum and Zain Padamsee and Miriam Parnes and Christian Pippin and Ava Zinman},
journal= {arXiv preprint arXiv:2312.01466},
year = {2025}
}
Comments
24 pages