Graph minors. XX: Wagner's conjecture (Q705888): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55934687, #quickstatements; #temporary_batch_1711094041063 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Graph minors. IV: Tree-width and well-quasi-ordering / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. XVII: Taming a vortex / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. XVIII: Tree-decompositions and well-quasi-ordering / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. XIX: Well-quasi-ordering on a surface. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592127 / rank | |||
Normal rank |
Revision as of 17:11, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graph minors. XX: Wagner's conjecture |
scientific article |
Statements
Graph minors. XX: Wagner's conjecture (English)
0 references
16 February 2005
0 references
This paper is the culmination of a series investigating graph minors. In this work the authors prove Wagner's conjecture: every infinite set of finite graphs contains one graph that is isomorphic to a minor of another. As a corollary: for every class of finite graphs closed under taking minors, there is a finite list of excluded minors characterizing that class. The result is of fundamental importance in graph theory.
0 references
graph
0 references
minor
0 references
surface embedding
0 references
well-quasi-ordering
0 references