Treewidth versus clique number: induced minors
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913561129779200 |
|---|---|
| author | Hilaire, Claire Milanič, Martin Trotignon, Nicolas Vasić, Djordje |
| author_facet | Hilaire, Claire Milanič, Martin Trotignon, Nicolas Vasić, Djordje |
| contents | We prove that a hereditary class of graphs is $(\mathsf{tw}, ω)$-bounded if and only if the induced minors of the graphs from the class form a $(\mathsf{tw}, ω)$-bounded class. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_17979 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Treewidth versus clique number: induced minors Hilaire, Claire Milanič, Martin Trotignon, Nicolas Vasić, Djordje Combinatorics 05C83 (Primary) 05C75, 05C69 (Secondary) We prove that a hereditary class of graphs is $(\mathsf{tw}, ω)$-bounded if and only if the induced minors of the graphs from the class form a $(\mathsf{tw}, ω)$-bounded class. |
| title | Treewidth versus clique number: induced minors |
| topic | Combinatorics 05C83 (Primary) 05C75, 05C69 (Secondary) |
| url | https://arxiv.org/abs/2410.17979 |