Subdivisions and near-linear stable sets
Combinatorics
2025-03-26 v2
Abstract
We prove that for every complete graph , all graphs with no induced subgraph isomorphic to a subdivision of have a stable subset of size at least . This is close to best possible, because for , not all such graphs have a stable set of linear size, even if is triangle-free.
Keywords
Cite
@article{arxiv.2409.09400,
title = {Subdivisions and near-linear stable sets},
author = {Tung Nguyen and Alex Scott and Paul Seymour},
journal= {arXiv preprint arXiv:2409.09400},
year = {2025}
}