 Pál Turán

Pál Turán worked in number theory and combinatorics. His1934 proof of the typical size of the number of prime divisors became an important precursor of probabilistic number theory: averaging a counting function can reveal the behaviour of almost all integers without computing it separately for each integer.^[ref] In extremal graph theory, the theorem carrying his name asks how many edges force a complete subgraph. The triangle case gives the sharp threshold$\lfloor n^2/4\rfloor$, attained by a balanced complete bipartite graph.

Homepage: mathshistory.st-andrews.ac.uk/Biographies/Turan/

Pál Turán was a Hungarian mathematician born on December 18, 1910, and he passed away on September 26, 1976. He is renowned for his significant contributions to various areas of mathematics, particularly in number theory, combinatorics, and probability theory. Turán is perhaps best known for the Turán inequalities and Turán's theorem in graph theory, which addresses the maximum number of edges in a graph that does not contain a specific complete subgraph.