Kruskal's tree theorem
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
The theorem was conjectured by Andrew Vázsonyi and proved by Joseph Kruskal (1960).
Proper noun[edit]
- (mathematics) 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.