Kruskal's tree theorem

Kruskal's tree theorem

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

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.

Excerpt from the Wikipedia article “Kruskal's tree theorem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Kruskal's tree theorem to your collection.

Play for free

Related cards