Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-08T05:20:39.922Z Has data issue: false hasContentIssue false
  • English
  • Français

On well-quasi-ordering finite trees

Published online by Cambridge University Press:  24 October 2008

C. St. J. A. Nash-Williams
C. St. J. A. Nash-Williams
Affiliation:
King's College, Aberdeen
Get access Rights & Permissions [Opens in a new window]

Abstract

A new and simple proof is given of the known theorem that, if T1, T2,… is an infinite sequence of finite trees, then there exist i and j such that i < j and Ti is homeomorphic to a subtree of Tj.

Type
Research Notes
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 59 , Issue 4 , October 1963 , pp. 833 - 835
Copyright
Copyright © Cambridge Philosophical Society 1963

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Higman, G.Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3), 2 (1952), 326–336CrossRefGoogle Scholar
(2)Kruskal, J. B.Well-quasi-ordering, the tree theorem, and Vázsonyi's conjecture. Trans. American Math. Soc 95 (1960), 210–225Google Scholar