Category
page 1Extremal graph theory
Ore's theorem
theorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle
Turán graph
complete multipartite graph for partitions whose sizes are as equal as possible
Turán's theorem
theorem bounding the number of edges in a graph that has no large cliques
extremal graph theory
area of mathematics
Erdős–Stone theorem
theorem in extremal graph theory