Pal Turan, also known as Paul Turan, was a Hungarian mathematician, born on 18 August 1910 and died on 26 September 1976. He worked primarily in extremal combinatorics, the study of how large or small a structure can be while avoiding a forbidden pattern. In 1940, because of his Jewish origins, he was arrested by the Nazis and sent to a labour camp in Transylvania, and while imprisoned he came up with some of his best theories, which he published after the war. He collaborated with Paul Erdos for 46 years, producing 28 joint papers.
Facts
Connections
Attributed Works
Source Turan's Theorem (Wikipedia)
In Branch
Source Pál Turán (Wikipedia)
Proofs Credited
Source Turan-Kubilius inequality (Wikipedia)
Source Turan's Theorem (Wikipedia)
In the Other Atlases
- Also in Geography Atlas: Hungary, nationality there.
Sources
1. Pál Turán (Wikipedia)
Lead paragraph
his Jewish origins, he was arrested by the Nazis and sent to a l
Lead paragraph [nationality-culture]
was a Hungarian mathematician
In Branch: Combinatorics, Lead paragraph [in-branch]
extremal combinatorics
View the SourceTuran's Theorem (Wikipedia)
Wikimedia FoundationProofs Credited: Turan's Theorem, Lead paragraph
In graph theory, Turán's theorem bounds the number of edges that can be included in an undirected graph that does not have a complete subgraph
Attributed Works: Turan Graph, Lead paragraph
In graph theory, Turán's theorem bounds the number of edges that can be included in an undirected graph that does not have a complete subgraph
View the Source Turan-Kubilius inequality (Wikipedia)
Proofs Credited: Turan-Kubilius Inequality, Lead paragraphQuote, Proofs Credited: Turan-Kubilius Inequality, Lead paragraph
The Turán-Kubilius inequality is a mathematical theorem in probabilistic number theory. It is useful for proving results about the
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.