Scott's induced subdivision conjecture for maximal triangle-free graphs
Abstract
Scott conjectured that the class of graphs with no induced subdivision of a given graph is -bounded. We verify his conjecture for maximal triangle-free graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.