In absence of long chordless cycles, large tree-width becomes a local phenomenon
Abstract
We prove that, for all and s, every graph of sufficiently large tree-width contains either a complete bipartite graph Ks,s or a chordless cycle of length greater than .
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.