Graph Minors. XX. Wagner's conjecture

Neil Robertson, P. D. Seymour

Research output: Contribution to journalArticlepeer-review

433 Scopus citations

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 languageEnglish (US)
Pages (from-to)325-357
Number of pages33
JournalJournal of Combinatorial Theory. Series B
Volume92
Issue number2 SPEC. ISS.
DOIs
StatePublished - 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

Fingerprint Dive into the research topics of 'Graph Minors. XX. Wagner's conjecture'. Together they form a unique fingerprint.

Cite this