Abstract
We prove Wagner's conjecture, that for every infinite set of finite graphs, one of its members is isomorphic to a minor of another.
Original language | English (US) |
---|---|
Pages (from-to) | 325-357 |
Number of pages | 33 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 92 |
Issue number | 2 SPEC. ISS. |
DOIs | |
State | Published - Nov 2004 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Keywords
- Graph
- Minor
- Surface embedding
- Well-quasi-ordering