The story
The theorem was conjectured by Andrew Vázsonyi and proved by Joseph Kruskal (1960).
Etymology from Wiktionary, CC BY-SA 4.0.
Kruskal's tree theorem
Today it means: 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. Full definition →