ESEndre Szemerédi
Endre Szemerédi
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Endre Szemerédi has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Gabor N. Sarkozy
Worcester Polytechnic Institute
10 shared publications - András Gyárfás
Hungarian Academy of Sciences
7 shared publications - Vojtěch Rödl
Emory Univ, Atlanta, GA 30322 USA
7 shared publications - Andrzej Ruciński
Department of Discrete Mathematics Adam Mickiewicz University Poznań Poland
5 shared publications - Miklós Ruszinkó
Hungarian Academy of Sciences
4 shared publications - János Komlós
Rutgers University
3 shared publications
Latest Publications
- 12 February 2019
- Published by Wiley in Proceedings of the London Mathematical Society
- Vol. 119 (2) , 409-439
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- 12 February 2019
- Published by Wiley in Proceedings of the London Mathematical Society
- Vol. 119 (2) , 409-439
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Open Access
Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs
We show that every 3-uniform hypergraph with $n$ vertices and minimum vertex degree at least $(5/9+o(1))\binom{n}2$ contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal.Open AccessMinimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs
We show that every 3-uniform hypergraph with $n$ vertices and minimum vertex degree at least $(5/9+o(1))\binom{n}2$ contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal. - 3 November 2016
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 16 (6) , 1737-1749
Structural Approach to Subset Sum Problems
- 3 November 2016
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 16 (6) , 1737-1749
Structural Approach to Subset Sum Problems
- Open Access
On the Hamiltonicity of triple systems with high minimum degree
We show that every 3-uniform hypergraph with minimum vertex degree at least $0.8\binom{n-1}{2}$ contains a tight Hamiltonian cycle.Open AccessOn the Hamiltonicity of triple systems with high minimum degree
We show that every 3-uniform hypergraph with minimum vertex degree at least $0.8\binom{n-1}{2}$ contains a tight Hamiltonian cycle. - 2 September 2015
- Published by Springer Nature in Communications in Mathematics and Statistics
- Vol. 3 (3) , 315-328
Arithmetic Progressions, Different Regularity Lemmas and Removal Lemmas
- 2 September 2015
- Published by Springer Nature in Communications in Mathematics and Statistics
- Vol. 3 (3) , 315-328
Arithmetic Progressions, Different Regularity Lemmas and Removal Lemmas
- 9 August 2013
- Published by Springer Nature
- p. 451-457
Autobiography
- 5 May 2010
- Published by Springer Nature in Annals of Combinatorics
- Vol. 14 (2) , 245-249
Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs
- 5 May 2010
- Published by Springer Nature in Annals of Combinatorics
- Vol. 14 (2) , 245-249
Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs
- 1 March 2010
- Published by Springer Nature in Combinatorica
- Vol. 30 (2) , 217-224
A fast algorithm for equitable coloring
- 1 March 2010
- Published by Springer Nature in Combinatorica
- Vol. 30 (2) , 217-224
A fast algorithm for equitable coloring