Word.ws English Dictionary

Kruskal's tree theorem

Kruskal's tree theorem proper noun: 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.

Proper noun

Kruskal's tree theorem

  1. 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.

Origin of Kruskal's tree theorem

The theorem was conjectured by Andrew Vázsonyi and proved by Joseph Kruskal (1960).

Questions about Kruskal's tree theorem

What does Kruskal's tree theorem mean?
Kruskal's tree theorem 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.
What part of speech is Kruskal's tree theorem?
Kruskal's tree theorem is a proper noun.

Words near Kruskal's tree theorem in the dictionary

  1. Kruses
  2. krushka
  3. krushkas
  4. Kruskal
  5. Kruskal's algorithm
  6. Kruskal's tree theorem
  7. Kruskal-Szekeres coordinates
  8. Kruszewski
  9. Kruszewskis
  10. krut'aite
  11. krutaite

Source and license

Adapted from Wiktionary: Kruskal's tree theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Kruskal's tree theorem.” Word.ws, https://word.ws/kruskal%27s_tree_theorem. Based on Wiktionary, CC BY-SA 4.0.