论文信息 - On well-quasi-ordering infinite trees

On well-quasi-ordering infinite trees

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.

C. Nash-Williams

[1] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .

[2] R. Rado. Partial well-ordering of sets of vectors , 1954 .

[3] J. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[4] C. St. J. A. Nash-Williams,et al. On well-quasi-ordering lower sets of finite trees , 1964, Mathematical Proceedings of the Cambridge Philosophical Society.