Authors
Citation
R. Diestel et R. Thomas, Excluding a countable clique, J COMB TH B, 76(1), 1999, pp. 41-67
Citations number
14
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN journal
00958956
→ ACNP
Volume
76
Issue
1
Year of publication
1999
Pages
41 - 67
Database
ISI
SICI code
0095-8956(199905)76:1<41:EACC>2.0.ZU;2-9
Abstract
We extend the excluded K-n minor theorem of Robertson and Seymour to infini
te graphs and deduce a structural characterization of the infinite graphs t
hat have no K-N0 minor. The latter is a refinement of an earlier characteri
zation of Robertson, Seymour, and the second author. (C) 1999 Academic Pres
s.