Kruskal's tree theorem
Meanings
name
- A theorem stating that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding.
Word forms
Etymology
The theorem was conjectured by Andrew Vázsonyi and proved by Joseph Kruskal (1960).
Related words
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.