Treewidth versus clique number: induced minors
Abstract
We prove that a hereditary class of graphs is (tw, ω)-bounded if and only if the induced minors of the graphs from the class form a (tw, ω)-bounded class.
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.