Ch12.pdf
math.uni-hamburg.de · 10,038 words · saved by 1 readers
N/A
12 Graph Minors Our goal in this last chapter is a single theorem, one which dwarfs any other result in graph theory and may doubtless be counted among the deepest theorems that mathematics has to o↵er: in every infinite set of graphs there are two such that one is a minor of the other. This graph mi- nor theorem, inconspicuous though it may look at first glance, has made a fundamental impact both outside graph theory and within. Its proof, due to Neil Robertson and Paul Seymour, takes well over 500 pages. So we have to be modest: of the actual…
saved by
related reading
- A simpler proof of the KPR theorem | tcs mathtcsmath.wordpress.com
- Exact Stability for Turan's Theoremarxiv.org
- Sublinear expandersias.edu
- 02_GyarfasLehel_AHellyTypeProblemInTrees.pdfusers.renyi.hu
- nullstellensatzweb.math.princeton.edu
- quasikernelarxiv.org
- 1102.3904.pdfarxiv.org
- unit-distance-proof.pdfcdn.openai.com
- Arborescences of Random Covering Graphsarxiv.org
- probmethod_notes.pdfyufeizhao.com
- unit-distance-cot.pdfcdn.openai.com
- Ramsey theory and strength of graphsarxiv.org