Dilworth's theorem

Dilworth's 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, in the areas of order theory and combinatorics, Dilworth's theorem states that, in any finite partially ordered set, the maximum size of an antichain of incomparable elements equals the minimum number of chains needed to cover all elements. This number is called the width of the partial order.

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

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

Play for free

Related cards