Rare card
Kruskal's tree theorem
- Value
- 50 W
- Attack
- 250
- Defence
- 200
- Players
- 0
In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding. A finitary application of the theorem gives the existence of a fast-growing TREE function.
Get Kruskal's tree theorem in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack