Turán's theorem (Q6480433)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: [[]] |
theorem bounding the number of edges in a graph that has no large cliques
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Turán's theorem |
theorem bounding the number of edges in a graph that has no large cliques |
Statements
Identifiers
5262016
0 references
