Buy Me a Coffee at ko-fi.com

Turán's theorem

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

Pronunciation
/Turán's ˈθɪərəm/
/Turán's ˈθiərəm/
Categories
theorem