Upper Bounds on the Graph Minor Theorem

DOI10.1007/978-3-030-30229-0_6zbMath1496.05179arXiv1907.00412OpenAlexW2955976619MaRDI QIDQ3295150

Michael Rathjen, Martin Krombholz

Publication date: 8 July 2020

Published in: Trends in Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.00412

Mathematics Subject Classification ID

Graph minors (05C83) Foundations of classical theories (including reverse mathematics) (03B30) Metamathematics of constructive systems (03F50)

Related Items

\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions

Cites Work

• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Graph minors XXIII. Nash-Williams' immersion conjecture
• A new system of proof-theoretic ordinal functions
• Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
• Graph minors. XIX: Well-quasi-ordering on a surface.
• Better-quasi-orderings and coinduction
• Graph minors. IV: Tree-width and well-quasi-ordering
• Graph minors. VIII: A Kuratowski theorem for general surfaces
• Graph Theory
• Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension