Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929648119578624 |
|---|---|
| author | Chudnovsky, Maria Hajebi, Sepehr Spirkl, Sophie |
| author_facet | Chudnovsky, Maria Hajebi, Sepehr Spirkl, Sophie |
| contents | The pathwidth of a graph $G$ is the smallest $w\in \mathbb{N}$ such that $G$ can be constructed from a sequence of graphs, each on at most $w+1$ vertices, by gluing them together in a linear fashion. We provide a full classification of the unavoidable induced subgraphs of graphs with large pathwidth. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_17756 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth Chudnovsky, Maria Hajebi, Sepehr Spirkl, Sophie Combinatorics The pathwidth of a graph $G$ is the smallest $w\in \mathbb{N}$ such that $G$ can be constructed from a sequence of graphs, each on at most $w+1$ vertices, by gluing them together in a linear fashion. We provide a full classification of the unavoidable induced subgraphs of graphs with large pathwidth. |
| title | Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2412.17756 |