Subdivisions and near-linear stable sets
Abstract
We prove that for every complete graph Kt, all graphs G with no induced subgraph isomorphic to a subdivision of Kt have a stable subset of size at least |G|/ polylog|G|. This is close to best possible, because for t 7, not all such graphs G have a stable set of linear size, even if G is triangle-free.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.