Krombholz, M and Rathjen, M
(Accepted: 2018)
Upper bounds on the graph minor theorem.
In: Schuster, P, Seisenberger, M and Weiermann, A, (eds.)
Springer Proceedings.
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031), 17-22 Jan 2016, Dagstuhl, Germany.
Springer
.
(In Press)
Abstract
Lower bounds on the proof-theoretic strength of the graph minor theorem were found over 30 years ago by [FRS87], but upper bounds have always been elusive. We present recently found upper bounds on the graph minor theorem and other theorems appearing in the Graph Minors series. Further, we give some ideas as to how the lower bounds on some of these theorems might be improved.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)