Abstract
A new and simple proof is given of the known theorem that, if T 1 , T 2, … , is an infinite sequence of finite trees, then there exist i and j such that i < j and T i is homeomorphic to a subtree of T j.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Higman. G. Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3), 2 (1952), 326–336.
Kruskal,. J. B. Well-quasi-ordering, the tree theorem, and Vázsony’s conjecture. Trans. American Math. Soc. 95 (1960). 210–225.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Birkhäuser Boston, a part of Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Nash-Williams, C.S.J.A. (2009). On Well-Quasi-Ordering Finite Trees. In: Gessel, I., Rota, GC. (eds) Classic Papers in Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4842-8_24
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4842-8_24
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4841-1
Online ISBN: 978-0-8176-4842-8
eBook Packages: Springer Book Archive