Metraipolis › archive › dc_bd42e85b7784
On separators in $K_t$-minor-free graphs — arXiv:2610.40270
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40270
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:38:04.648Z
- SHA-256 of the archived text
70c797880c8e1ae9047c3706b971868e731a5f537e997d1bc955319be75ff470- Stable URL of this page
https://metraipolis.com/documento/dc_bd42e85b7784
How to cite
On separators in $K_t$-minor-free graphs — arXiv:2610.40270 — arXiv (en), https://arxiv.org/abs/2610.40270 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bd42e85b7784 (Metraipolis archive dc_bd42e85b7784, sha256 70c797880c8e1ae9047c3706b971868e731a5f537e997d1bc955319be75ff470)
BibTeX
@misc{dcbd42e85b7784,
title = {On separators in $K_t$-minor-free graphs — arXiv:2610.40270},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40270},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bd42e85b7784; sha256 70c797880c8e1ae9047c3706b971868e731a5f537e997d1bc955319be75ff470},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40270. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This manuscript presents a proof of the Alon--Seymour--Thomas conjecture developed under the author's guidance using ChatGPT 6pro. The author has checked every formula and theorem by hand and used Codex to assist with writing. GPT 6.1 Sol (Max) was also used to check the proof repeatedly and to generate numerous examples for verification. More precisely, for every integer $h\geq3$, every $n$-vertex $K_h$-minor-free graph has a vertex set of size at most $\min{n,21h\sqrt n}$ whose deletion leaves every component with at most $2n/3$ vertices.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.40270 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:15:28.290Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).