Turán's theorem
Turán'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 graph theory, Turán's theorem bounds the number of edges that can be included in an undirected graph that does not have a complete subgraph of a given size.
Excerpt from the Wikipedia article “Turán's theorem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Open free boosters and add Turán's theorem to your collection.
Play for free




