English Turán's theorem Cited by user David Eppstein on 20 Nov 2020 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.