Q1047749

From Wikidata
Jump to: navigation, search

Turán's theorem (Q1047749)[edit]

theorem bounding the number of edges in a graph that has no large cliques [edit]

No aliases defined. [add]

Statements

/m/01_dgg
[edit]
1 reference
[add]