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.
Metadata
Authors/Creators: |
|
||||
---|---|---|---|---|---|
Keywords: | Proof theory; Graph Minor Theorem | ||||
Dates: |
|
||||
Institution: | The University of Leeds | ||||
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Mathematics (Leeds) > Pure Mathematics (Leeds) | ||||
Funding Information: |
|
||||
Depositing User: | Symplectic Publications | ||||
Date Deposited: | 10 Jul 2019 16:29 | ||||
Last Modified: | 08 Aug 2019 14:40 | ||||
Status: | In Press | ||||
Publisher: | Springer | ||||
Related URLs: |
Download
Filename: book chapter.pdf
