Graph Minors. XX. Wagner's conjecture

Neil Robertson; P. D. Seymour

doi:10.1016/j.jctb.2004.08.001

Graph Minors. XX. Wagner's conjecture

Neil Robertson, P. D. Seymour

Mathematics

Research output: Contribution to journal › Article › peer-review

493 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 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	https://doi.org/10.1016/j.jctb.2004.08.001
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

Access to Document

10.1016/j.jctb.2004.08.001

Cite this

@article{c8707249c73f49f1813266776efc26cd,

title = "Graph Minors. XX. Wagner's conjecture",

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.",

keywords = "Graph, Minor, Surface embedding, Well-quasi-ordering",

author = "Neil Robertson and Seymour, {P. D.}",

note = "Funding Information: 2This research was partially supported by NSF Grant DMS 8504054 and was partially performed under a consulting agreement with Bellcore. 3Present address: Mathematics Department, Princeton University, 201 Fine Hall, Princeton, NJ 08544, USA.",

year = "2004",

month = nov,

doi = "10.1016/j.jctb.2004.08.001",

language = "English (US)",

volume = "92",

pages = "325--357",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "2 SPEC. ISS.",

}

TY - JOUR

T1 - Graph Minors. XX. Wagner's conjecture

AU - Robertson, Neil

AU - Seymour, P. D.

N1 - Funding Information: 2This research was partially supported by NSF Grant DMS 8504054 and was partially performed under a consulting agreement with Bellcore. 3Present address: Mathematics Department, Princeton University, 201 Fine Hall, Princeton, NJ 08544, USA.

PY - 2004/11

Y1 - 2004/11

N2 - We prove Wagner's conjecture, that for every infinite set of finite graphs, one of its members is isomorphic to a minor of another.

AB - We prove Wagner's conjecture, that for every infinite set of finite graphs, one of its members is isomorphic to a minor of another.

KW - Graph

KW - Minor

KW - Surface embedding

KW - Well-quasi-ordering

UR - http://www.scopus.com/inward/record.url?scp=9144239509&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=9144239509&partnerID=8YFLogxK

U2 - 10.1016/j.jctb.2004.08.001

DO - 10.1016/j.jctb.2004.08.001

M3 - Article

AN - SCOPUS:9144239509

SN - 0095-8956

VL - 92

SP - 325

EP - 357

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 2 SPEC. ISS.

ER -

Graph Minors. XX. Wagner's conjecture

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this