Graph Minors. XX. Wagner's conjecture

https://doi.org/10.1016/j.jctb.2004.08.001Get rights and content
Under an Elsevier user license
open archive

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

Cited by (0)

1

This research was partially supported by NSF Grant DMS 8504054 and was partially performed under a consulting agreement with Bellcore.

2

Present address: Mathematics Department, Princeton University, 201 Fine Hall, Princeton, NJ 08544, USA.

Copyright © 2004 Elsevier Inc. All rights reserved.