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.
@article{arxiv.2410.17979,
title = {Treewidth versus clique number: induced minors},
author = {Claire Hilaire and Martin Milanič and Nicolas Trotignon and Djordje Vasić},
journal= {arXiv preprint arXiv:2410.17979},
year = {2024}
}