Indexed metadata
On well-quasi-ordering finite trees
C. St. J. A. Nash-Williams
Source record
Source: Crossref
Published: Oct 1, 1963
DOI: 10.1017/s0305004100003844
Open original source ↗Source abstract
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 .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.