Paperlane

no. 14 · Friday 13 November 2026

On separators in $K_h$-minor-free graphs

Xinheng Lin

math.CO · v2 · 21 pp

Abstract

This manuscript presents a proof of the Alon–Seymour–Thomas conjecture developed under the author's guidance using ChatGPT 6pro. More precisely, for every integer $h\geq3$, every $n$-vertex $K_h$-minor-free graph has a vertex set of size at most $16h\sqrt n$ whose deletion leaves every component with at most $2n/3$ vertices. The author has checked every formula and theorem by hand and used Codex to assist with writing (editing formulas, polishing the language, and typesetting). GPT 6.1 Sol (Max) was also used to check the proof repeatedly and to generate numerous examples for verification. The author takes full responsibility for the correctness of the proof.

comments
21 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.40270 ↗