On separators in $K_t$-minor-free graphs

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.