On well-quasi-ordering infinite trees - Nash-Williams's theorem revisited

Authors
Citation
D. Kuhn, On well-quasi-ordering infinite trees - Nash-Williams's theorem revisited, MATH PROC C, 130, 2001, pp. 401-408
Citations number
9
Categorie Soggetti
Mathematics
Journal title
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY
ISSN journal
03050041 → ACNP
Volume
130
Year of publication
2001
Part
3
Pages
401 - 408
Database
ISI
SICI code
0305-0041(200105)130:<401:OWIT-N>2.0.ZU;2-Z
Abstract
Nash-Williams proved that; the infinite trees are well-quasi-ordered (indee d, better-quasi-ordered) under the topological minor relation. We combine i deas of several authors into a more accessible and essentially self-contain ed short proof.