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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper noun
  1. mathematicsA 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

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

Full word history & related roots →
Cite this entry
APA

Kruskal's tree theorem. (n.d.). In WatkinsX Dictionary. Retrieved November 5, 2026, from https://dictionary.watkinsx.com/word/Kruskal's%20tree%20theorem

MLA

“Kruskal's tree theorem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Kruskal's%20tree%20theorem. Accessed November 5, 2026.

Chicago

WatkinsX Dictionary, s.v. “Kruskal's tree theorem,” accessed November 5, 2026, https://dictionary.watkinsx.com/word/Kruskal's%20tree%20theorem.

Source: Kruskal's tree theorem on Wiktionary, CC BY-SA 4.0.