Pál Turán (Hungarian: [ˈpaːl ˈturaːn]; 18 August 1910 – 26 September 1976) also known as Paul Turán, was a Hungarian mathematician who worked primarily...

(i.e. when s = 0 {\displaystyle s=0} ). Turán graphs are named after Pál Turán, who used them to prove Turán's theorem, an important result in extremal...

graphs. Turán's theorem, and the Turán graphs giving its extreme case, were first described and studied by Hungarian mathematician Pál Turán in 1941....

Paul Erdős (Hungarian: Erdős Pál [ˈɛrdøːʃ ˈpaːl]; 26 March 1913 – 20 September 1996) was a Hungarian mathematician. He was one of the most prolific mathematicians...

Pach, János (2010-12-16), Anastasatos' Conjecture, retrieved 2017-01-21. Pál Turán (1970). "The Work of Alfréd Rényi". Matematikai Lapok 21: 199–210. "Rényi...

goes to infinity. A simple proof to the result Turán (1934) was given by Pál Turán, who used the Turán sieve to prove that ∑ n ≤ x | ω ( n ) − log ⁡ log...

Erdős conjecture on arithmetic progressions) posed by Paul Erdős and Pál Turán in 1941. The question concerns subsets of the natural numbers, typically...

are expressed by congruences. It was developed by Pál Turán in 1934. In terms of sieve theory the Turán sieve is of combinatorial type: deriving from a...

function.: 305–308  The theorem was proved in a special case in 1934 by Pál Turán and generalized in 1956 and 1964 by Jonas Kubilius.: 316  This formulation...

Erdős and Alfréd Rényi. She also collaborated frequently with her husband Pál Turán, an analyst, number theorist, and combinatorist. Until 1987, she worked...