Endre Szemeredi is a Hungarian-American mathematician and computer scientist, born on 21 August 1940, who works in combinatorics and theoretical computer science. He is State of New Jersey Professor of Computer Science Emeritus at Rutgers University, where he served from 1986, and holds emeritus status at the Alfred Renyi Institute of Mathematics of the Hungarian Academy of Sciences. He won the Abel Prize in 2012. His discoveries include Szemeredi's theorem, the Szemeredi regularity lemma, the Erdos-Szemeredi theorem, the Hajnal-Szemeredi theorem and the Szemeredi-Trotter theorem.
Facts
Connections
In Branch
Source Endre Szemerédi (Wikipedia)
Principal Result
Source Endre Szemerédi (Wikipedia)
Source Endre Szemerédi (Wikipedia)
Proofs Credited
Source Corners theorem (Wikipedia)
Source Crossing Number Inequality (Wikipedia)
Source Equitable coloring (Wikipedia)
Source Szemeredi regularity lemma, Wikipedia
Source Szemeredi's Theorem (Wikipedia)
In the Other Atlases
Same As
Also in Science Atlas: the same subject.
Nationality
Also in Geography Atlas: the nationality of this subject.
Source Endre Szemerédi (Wikipedia)Lead paragraph [nationality-culture]Quote, Lead paragraph [nationality-culture]
is a Hungarian-American mathematician
Also in Geography Atlas: the nationality of this subject.
Source Endre Szemerédi (Wikipedia)Lead paragraph [nationality-culture]Quote, Lead paragraph [nationality-culture]
is a Hungarian-American mathematician
Sources
1. Endre Szemerédi (Wikipedia)
Lead paragraph
He is the State of New Jersey Professor of Computer Science Eme
Lead paragraph [nationality-culture]
is a Hungarian-American mathematician
Principal Result: Szemeredi's Theorem, Article text
He has made a number of discoveries in combinatorics and computer science, including Szemerédi's theorem, the Szemerédi regularity lemma, the Erdős-Szemerédi theorem, the Hajnal-Szemerédi theorem and the Szemerédi-Trotter theorem.
Principal Result: Szemeredi Regularity Lemma, Article text
He has made a number of discoveries in combinatorics and computer science, including Szemerédi's theorem, the Szemerédi regularity lemma, the Erdős-Szemerédi theorem, the Hajnal-Szemerédi theorem and the Szemerédi-Trotter theorem.
In Branch: Combinatorics, Lead paragraph [in-branch]
combinatorics
View the Source2. The Norwegian Academy of Science and Letters: Abel Prize laureates
The Norwegian Academy of Science and LettersLaureates list, 2012Quote, Laureates list, 2012
2012: Endre Szemerédi
Szemeredi regularity lemma, Wikipedia
Proofs Credited: Szemeredi Regularity Lemma, Lead paragraphQuote, Proofs Credited: Szemeredi Regularity Lemma, Lead paragraph
In extremal graph theory, Szemerédi's regularity lemma states that a graph can be partitioned into a bounded number of parts so that the edges between parts
Crossing Number Inequality (Wikipedia)
Wikimedia FoundationProofs Credited: Crossing Number Inequality, Lead paragraphQuote, Proofs Credited: Crossing Number Inequality, Lead paragraph
and was discovered independently by Ajtai, Chvátal, Newborn, and Szemerédi
Corners theorem (Wikipedia)
Proofs Credited: Corners Theorem, Lead paragraphQuote, Proofs Credited: Corners Theorem, Lead paragraph
. It was first proved by Miklós Ajtai and Endre Szemerédi in 1974 using Szemerédi's theorem. In 2003, József Solymosi gave a short proof using the triangle removal lemma.
Equitable coloring (Wikipedia)
Proofs Credited: Hajnal-Szemerédi Theorem, Lead paragraphQuote, Proofs Credited: Hajnal-Szemerédi Theorem, Lead paragraph
The Hajnal-Szemerédi theorem, posed as a conjecture by Paul Erdős (1964) and proven by András Hajnal and Endre Szemerédi (1970), states that
Szemeredi's Theorem (Wikipedia)
Wikimedia FoundationProofs Credited: Szemeredi's Theorem, LeadQuote, Proofs Credited: Szemeredi's Theorem, Lead
Endre Szemerédi proved the conjecture in 1975.
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.