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)
Proofs Credited
Source Corners theorem (Wikipedia)
Source Crossing Number Inequality (Wikipedia)
Source Equitable coloring (Wikipedia)
Source Szemeredi regularity lemma, Wikipedia
In the Other Atlases
- Also in Geography Atlas: Hungary, nationality there.
- Also in Geography Atlas: United States, nationality there.
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
In Branch: Combinatorics, Lead paragraph [in-branch]
combinatorics
View the SourceSzemeredi 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-Szemeredi Theorem, Lead paragraphQuote, Proofs Credited: Hajnal-Szemeredi 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
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.