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...

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....

(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...

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...

Erdős conjecture on arithmetic progressions) posed by Paul Erdős and Pál Turán in 1941. It concerns additive bases, subsets of natural numbers with the...

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...

some special cases solved. During World War II, Hungarian mathematician Pál Turán was forced to work in a brick factory, pushing wagon loads of bricks from...

was proved by Paul Erdős and Pál Turán in 1948. Let μ be a probability measure on the unit circle R/Z. The Erdős–Turán inequality states that, for any...

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...

doi:10.1007/BF03024187. S2CID 122827181. The life of Alfréd Rényi, by Pál Turán O'Connor, John J.; Robertson, Edmund F., "Alfréd Rényi", MacTutor History...

Mohács Pál Turán (1910–1976), also known as Paul Turán, Hungarian mathematician Pál Várhidi (1931–2015), Hungarian football player and manager Pál Völner...

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

subset E is itself an interval, the inequality was proved by Pál Turán and is known as Turán's lemma. This inequality also extends to L p ( T ) ,   0 ≤ p...

drawing. The study of crossing numbers originated in Turán's brick factory problem, in which Pál Turán asked for a factory plan that minimized the number...

painter and sculptor Fatih Turan (born 1993), Turkish footballer Frigyes Turán (born 1974), Hungarian rally driver Gülistan Turan (born 1997), Turkish female...

In mathematics, Turán's inequalities are some inequalities for Legendre polynomials found by Pál Turán (1950) (and first published by Szegö (1948)). There...

the Faculty of Sciences of the Eötvös Loránd University, Budapest. With Pál Turán, Halász proved zero density results on the roots of the Riemann zeta function...

Sudakov Endre Szemerédi Terence Tao Carsten Thomassen Jacques Touchard Pál Turán Bartel Leendert van der Waerden Herbert Wilf Richard Wilson Doron Zeilberger...

known for his proof from 1975 of an old conjecture of Paul Erdős and Pál Turán: if a sequence of natural numbers has positive upper density then it contains...

Anonymous group in Budapest, Pál Erdős (Paul Erdős) (Hungarian: Erdős Pál), Pál Turán (Paul Turán) (Hungarian: Turán Pál), György Szekeres (George Szekeres)...

optimal Golomb rulers. The following construction, due to Paul Erdős and Pál Turán, produces a Golomb ruler for every odd prime p. 2 p k + ( k 2 mod p )...

András Hajnal 56 Ralph Faudree 50 Richard Schelp 42 Cecil C. Rousseau 35 Vera T. Sós 35 Alfréd Rényi 32 Pál Turán 30 Endre Szemerédi 29 Ronald Graham 28...

Egyed, Paul Erdős, Tibor Gallai, György Hajós, József Kraus, Tibor Szele, Pál Turán, Endre Vázsonyi, and many others. He went on to write the first book on...

n0 (this conjecture is occasionally–though incorrectly–attributed to Pál Turán). This was then disproved by Haselgrove (1958), who showed that T(n) takes...

mathematicians such as John von Neumann, Paul Erdős, George Pólya and Pál Turán. Thanks to Fejér, Hungary has developed a strong mathematical school:...

to some speculation about a relationship with the Riemann hypothesis. Pál Turán (1948) showed that if the functions ∑ n = 1 N n − s {\displaystyle \sum...

body of research, the question has remained unsolved. Paul Erdős and Pál Turán proved that, for every x > 0 {\displaystyle x>0} , the number of elements...

progression. These sequences had been studied in 1936 by Paul Erdős and Pál Turán, who conjectured that they must be sparse. However, in 1942, Raphaël Salem...

called null graph. Turán 1.  Pál Turán 2.  A Turán graph is a balanced complete multipartite graph. 3.  Turán's theorem states that Turán graphs have the...