Theoremcore
Turán's theorem
Also called Turán graph theorem.
The most edges a K(r+1)-free graph can have is attained by the Turán graph.
The most edges a K(r+1)-free graph can have is attained by the Turán graph.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 7NWGMT Edit this page History Report an error