The story
Named after the Hungarian mathematician Pál Turán.
Etymology from Wiktionary, CC BY-SA 4.0.
Today it means: A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges. Full definition →
Named after the Hungarian mathematician Pál Turán.
Etymology from Wiktionary, CC BY-SA 4.0.