Definitions from Wiktionary (Kruskal's tree theorem)

▸ noun:  (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.


▸ Words similar to Kruskal's tree theorem
▸ Usage examples for Kruskal's tree theorem

▸ Idioms related to Kruskal's tree theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near Kruskal's tree theorem
▸ Rhymes of Kruskal's tree theorem

▸ Invented words related to Kruskal's tree theorem