Polynomial Bounds for the Graph Minor Structure Theorem
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909563408613376 |
|---|---|
| author | Gorsky, Maximilian Seweryn, Michał T. Wiederrecht, Sebastian |
| author_facet | Gorsky, Maximilian Seweryn, Michał T. Wiederrecht, Sebastian |
| contents | The Graph Minor Structure Theorem, originally proven by Robertson and Seymour [JCTB, 2003], asserts that there exist functions $f_1, f_2 \colon \mathbb{N} \to \mathbb{N}$ such that for every non-planar graph $H$ with $t := |V(H)|$, every $H$-minor-free graph can be obtained via the clique-sum operation from graphs which embed into surfaces where $H$ does not embed after deleting at most $f_1(t)$ many vertices with up to at most $t^2-1$ many ``vortices'' which are of ``depth'' at most $f_2(t)$. In the proof presented by Robertson and Seymour the functions $f_1$ and $f_2$ are non-constructive. Kawarabayashi, Thomas, and Wollan [arXiv, 2020] found a new proof showing that $f_1(t), f_2(t) \in 2^{\mathbf{poly}(t)}$. While believing that this bound was the best their methods could achieve, Kawarabayashi, Thomas, and Wollan conjectured that $f_1$ and $f_2$ can be improved to be polynomials.
In this paper we confirm their conjecture and prove that $f_1(t), f_2(t) \in \mathbf{O}(t^{2300})$. Our proofs are fully constructive and yield a polynomial-time algorithm that either finds $H$ as a minor in a graph $G$ or produces a clique-sum decomposition for $G$ as above. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_02532 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Polynomial Bounds for the Graph Minor Structure Theorem Gorsky, Maximilian Seweryn, Michał T. Wiederrecht, Sebastian Combinatorics Discrete Mathematics 05C10, 05C40, 05C75, 05C83, 05C85, 68R05, 68R10 G.2.1; G.2.2 The Graph Minor Structure Theorem, originally proven by Robertson and Seymour [JCTB, 2003], asserts that there exist functions $f_1, f_2 \colon \mathbb{N} \to \mathbb{N}$ such that for every non-planar graph $H$ with $t := |V(H)|$, every $H$-minor-free graph can be obtained via the clique-sum operation from graphs which embed into surfaces where $H$ does not embed after deleting at most $f_1(t)$ many vertices with up to at most $t^2-1$ many ``vortices'' which are of ``depth'' at most $f_2(t)$. In the proof presented by Robertson and Seymour the functions $f_1$ and $f_2$ are non-constructive. Kawarabayashi, Thomas, and Wollan [arXiv, 2020] found a new proof showing that $f_1(t), f_2(t) \in 2^{\mathbf{poly}(t)}$. While believing that this bound was the best their methods could achieve, Kawarabayashi, Thomas, and Wollan conjectured that $f_1$ and $f_2$ can be improved to be polynomials. In this paper we confirm their conjecture and prove that $f_1(t), f_2(t) \in \mathbf{O}(t^{2300})$. Our proofs are fully constructive and yield a polynomial-time algorithm that either finds $H$ as a minor in a graph $G$ or produces a clique-sum decomposition for $G$ as above. |
| title | Polynomial Bounds for the Graph Minor Structure Theorem |
| topic | Combinatorics Discrete Mathematics 05C10, 05C40, 05C75, 05C83, 05C85, 68R05, 68R10 G.2.1; G.2.2 |
| url | https://arxiv.org/abs/2504.02532 |