Ask a Question

Prefer a chat interface with context about you and your work?

Treewidth versus clique number: induced minors

Treewidth versus clique number: induced minors

We prove that a hereditary class of graphs is $(\mathsf{tw}, \omega)$-bounded if and only if the induced minors of the graphs from the class form a $(\mathsf{tw}, \omega)$-bounded class.