×
Author ID: szemeredi.endre Recent zbMATH articles by "Szemerédi, Endre"
Published as: Szemerédi, Endre; Szemerédi, E.; Szemeredi, E.; Szemeredi, Endre; Szemeŕedi, Endre
Further Spellings: Семереди Эндре
Homepage: https://users.renyi.hu/~szemered/
External Links: MacTutor · MGP · Wikidata · Google Scholar · Math-Net.Ru · dblp · GND
Awards: Abel Prize (2012)
all top 5

Co-Authors

21 single-authored
50 Komlós, János
30 Erdős, Pál
21 Sarkozy, Gabor N.
20 Ajtai, Miklós
18 Rodl, Vojtech
17 Sárközy, András
13 Gyárfás, András
12 Simonovits, Miklós
11 Ruciński, Andrzej
9 Pintz, Janos
7 Chvátal, Václav
7 Hajnal, András
7 Steiger, William L.
6 Hladký, Jan
6 Piguet, Diana
6 Stein, Maya Jakobine
6 Trotter, William T. jun.
6 Vũ Hà Văn
5 Ruszinkó, Miklós
4 Schacht, Mathias
4 Sós, Vera Turán
3 Bollobás, Béla
3 Hajnal, Péter
3 Ma, Yuan
3 Sulyok, Miklós
3 Wigderson, Avi
2 Alon, Noga
2 Babai, László
2 Balog, Antal
2 Choi, S. L. G.
2 Cole, Richard John
2 Csaba, Béla
2 Galil, Zvi
2 Graham, Ronald Lewis
2 Kannan, Ravindran
2 Khalfalah, Ayman
2 Kohayakawa, Yoshiharu
2 Levitt, Ian
2 Nguyen, Hoi H.
2 Ruzsa, Imre Z.
2 Salowe, Jeffrey S.
2 Spencer, Joel H.
2 Turán, Gyorgy
2 Tuza, Zsolt
1 Atiyah, Michael Francis
1 Bruck, Jehoshua
1 Capalbo, Michael
1 Carleson, Lennart
1 Chung, Fan
1 Cypher, Robert
1 Deligne, Pierre
1 Fredman, Michael L.
1 Geréb-Graus, Mihály
1 Gromov, Mikhael Leonidovich
1 Guibas, Leonidas John
1 Ho, Ching-Tien
1 Iwaniec, Henryk
1 Jozsa, Sandor
1 Kahale, Nabil
1 Kahn, Jeff D.
1 Karabeg, Dino
1 Katona, Gyula O. H.
1 Kierstead, Henry A.
1 Kiersteadi, H. A.
1 Kostochka, Aleksandr Vasil’evich
1 Lax, Peter David
1 Leighton, Tom
1 Lovász, László
1 Łuczak, Tomasz
1 Maass, Wolfgang
1 Martin, Ryan R.
1 Milner, Eric Charles
1 Milnor, John Willard
1 Mydlarz, Marcelo
1 Nagy-György, Judit
1 Naor, Moni
1 Nash, John Forbes jun.
1 Newborn, Monroe M.
1 Nirenberg, Louis
1 Nisan, Noam
1 Pach, János
1 Paturi, Ramamohan
1 Plaxton, C. Greg
1 Polcyn, Joanna
1 Prömel, Hans Jürgen
1 Pudlák, Pavel
1 Pyber, László
1 Ragde, Prabhakar L.
1 Raussen, Martin
1 Razborov, Aleksandr Aleksandrovich
1 Reiher, Christian
1 Schnitger, Georg
1 Selkow, Stanley M.
1 Serre, Jean-Pierre
1 Shakan, George
1 Shokoufandeh, Ali
1 Shokoufander, A.
1 Sinaĭ, Yakov Grigor’evich
1 Skau, Christian Fredrik
1 Solymosi, József
...and 10 more Co-Authors
all top 5

Serials

17 Combinatorica
10 Discrete Mathematics
10 Acta Arithmetica
9 Combinatorics, Probability and Computing
8 Studia Scientiarum Mathematicarum Hungarica
8 SIAM Journal on Discrete Mathematics
6 Journal of Combinatorial Theory. Series B
6 Matematikai Lapok
5 Journal of Graph Theory
4 Journal of Combinatorial Theory. Series A
4 Journal of Computer and System Sciences
4 Journal of the London Mathematical Society. Second Series
4 European Journal of Combinatorics
3 Publicationes Mathematicae Debrecen
3 Acta Mathematica Hungarica
3 Annals of Combinatorics
2 Acta Mathematica Academiae Scientiarum Hungaricae
2 Information Processing Letters
2 Periodica Mathematica Hungarica
2 Advances in Mathematics
2 Commentationes Mathematicae Universitatis Carolinae
2 Journal of the Association for Computing Machinery
2 Proceedings of the London Mathematical Society. Third Series
2 Discrete & Computational Geometry
2 Journal of the American Mathematical Society
2 Random Structures & Algorithms
2 The Electronic Journal of Combinatorics
2 Journal of the London Mathematical Society
1 Computers & Mathematics with Applications
1 Journal of Mathematical Analysis and Applications
1 Mathematics of Computation
1 Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Mathematica
1 Bulletin of the London Mathematical Society
1 Canadian Mathematical Bulletin
1 Duke Mathematical Journal
1 Journal of Number Theory
1 Mathematika
1 SIAM Journal on Computing
1 Soviet Mathematics. Doklady
1 Theoretical Computer Science
1 Transactions of the American Mathematical Society
1 Graphs and Combinatorics
1 Journal of the Australian Mathematical Society. Series A
1 Computational Complexity
1 Annals of Mathematics. Second Series
1 Foundations of Computational Mathematics
1 Journal of the Australian Mathematical Society
1 Colloquia Mathematica Societatis János Bolyai
1 Electronic Research Announcements in Mathematical Sciences
1 Communications in Mathematics and Statistics

Publications by Year

Citations contained in zbMATH Open

171 Publications have been cited 4,764 times in 3,186 Documents Cited by Year
On sets of integers containing no \(k\) elements in arithmetic progression. Zbl 0303.10056
Szemerédi, Endre
315
1975
Sorting in \(c \log n\) parallel steps. Zbl 0523.68048
Ajtai, M.; Komlos, J.; Szemeredi, E.
203
1983
Extremal problems in discrete geometry. Zbl 0541.05012
Szemerédi, Endre; Trotter, William T. jun.
199
1983
Proof of a conjecture of P. Erdős. Zbl 0217.02601
Hajnal, András; Szemerédi, E.
187
1970
A note on Ramsey numbers. Zbl 0455.05045
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
155
1980
Storing a sparse table with O(1) worst case access time. Zbl 0629.68068
Fredman, Michael L.; Komlós, János; Szemerédi, Endre
142
1984
Regular partitions of graphs. Zbl 0413.05055
Szemerédi, Endre
135
1978
Blow-up lemma. Zbl 0880.05049
Komlós, J.; Sárközy, G. N.; Szemerédi, E.
133
1997
Triple systems with no six points carrying three triangles. Zbl 0393.05031
Ruzsa, I. Z.; Szemerédi, E.
132
1978
A Dirac-type theorem for 3-uniform hypergraphs. Zbl 1082.05057
Rödl, Vojtěch; Ruciński, Andrzej; Szemerédi, Endre
114
2006
Crossing-free subgraphs. Zbl 0502.05021
Ajtai, M.; Chvatal, V.; Newborn, M. M.; Szemeredi, E.
110
1982
Many hard examples for resolution. Zbl 0712.03008
Chvátal, Vašek; Szemerédi, Endre
94
1988
Limit distribution for the existence of Hamiltonian cycles in a random graph. Zbl 0521.05055
Komlós, János; Szemerédi, Endre
89
1983
An approximate Dirac-type theorem for \(k\)-uniform hypergraphs. Zbl 1164.05051
Rödl, Vojtěch; Ruciński, Andrzej; Szemerédi, Endre
78
2008
Perfect matchings in large uniform hypergraphs with large minimum collective degree. Zbl 1214.05130
Rödl, Vojtech; Ruciński, Andrzej; Szemerédi, Endre
74
2009
Proof of the Alon-Yuster conjecture. Zbl 0977.05106
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
70
2001
Proof of the Seymour conjecture for large graphs. Zbl 0917.05043
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
70
1998
On the probability that a random \(\pm 1\)-matrix is singular. Zbl 0829.15018
Kahn, Jeff; Komlós, János; Szemerédi, Endre
69
1995
The Ramsey number of a graph with bounded maximum degree. Zbl 0547.05044
Chvatál, Václav; Rödl, Vojtěch; Szemerédi, E.; Trotter, W. T. jun.
65
1983
The longest path in a random graph. Zbl 0489.05052
Ajtai, Miklos; Komlos, Janos; Szemeredi, Endre
59
1981
A dense infinite Sidon sequence. Zbl 0474.10038
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
58
1981
Topological cliques in graphs. II. Zbl 0846.05023
Komloś, János; Szemerédi, Endre
57
1996
On sums and products of integers. Zbl 0526.10011
Erdős, Paul; Szemerédi, E.
51
1983
Three-color Ramsey numbers for paths. Zbl 1175.05093
Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor N.; Szemerédi, Endre
50
2007
On sets of integers containing no \(k\) elements in arithmetic progression. Zbl 0335.10054
Szemerédi, E.
49
1975
On sets of integers containing no four elements in arithmetic progression. Zbl 0175.04301
Szemerédi, E.
49
1969
A statistical theorem of set addition. Zbl 0812.11017
Balog, Antal; Szemerédi, Endre
49
1994
Unit distances in the Euclidean plane. Zbl 0561.52008
Spencer, J.; Szemerédi, E.; Trotter, W. jun.
48
1984
Partitioning two-coloured complete graphs into two monochromatic cycles. Zbl 0916.05025
Łuczak, Tomasz; Rödl, Vojtěch; Szemerédi, Endre
45
1998
An improved bound for the monochromatic cycle partition number. Zbl 1115.05031
Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor N.; Szemerédi, Endre
44
2006
An optimal-time algorithm for slope selection. Zbl 0678.68033
Cole, Richard; Salowe, Jeffrey S.; Steiger, W. L.; Szemerédi, Endre
41
1989
Largest random component of a k-cube. Zbl 0489.05053
Ajtai, M.; Komlos, J.; Szemeredi, E.
41
1982
Extremal uncrowded hypergraphs. Zbl 0485.05049
Ajtai, M.; Komlos, J.; Pintz, J.; Spencer, J.; Szemeredi, E.
40
1982
Perfect matchings in uniform hypergraphs with large minimum degree. Zbl 1104.05051
Rödl, Vojtech; Ruciński, Andrzej; Szemerédi, Endre
40
2006
Integer sets containing no arithmetic progressions. Zbl 0721.11007
Szemerédi, E.
40
1990
Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs. Zbl 1220.05083
Rödl, Vojtech; Ruciński, Andrzej; Szemerédi, Endre
37
2011
An algorithmic version of the blow-up lemma. Zbl 0917.05071
Komlós, János; Sárközy, Gabor N.; Szemerédi, Endre
36
1998
The regularity lemma and its applications in graph theory. Zbl 1054.68103
Komlós, János; Shokoufandeh, Ali; Simonovits, Miklós; Szemerédi, Endre
36
2002
A cure for the telephone disease. Zbl 0251.05132
Hajnal, András; Milner, E. C.; Szemerédi, E.
36
1972
A fast algorithm for equitable coloring. Zbl 1224.05176
Kierstead, Henry A.; Kostochka, Alexandr V.; Mydlarz, Marcelo; Szemerédi, Endre
35
2010
A lower bound for Heilbronn’s problem. Zbl 0483.52008
Komlos, Janos; Pintz, Janos; Szemeredi, Endre
33
1982
More results on Ramsey-Turán type problems. Zbl 0526.05031
Erdős, Paul; Hajnal, András; Sós, Vera T.; Szemeredi, E.
33
1983
On a Ramsey type theorem. Zbl 0242.05122
Erdős, Paul; Szemerédi, E.
33
1972
On the square of a Hamiltonian cycle in dense graphs. Zbl 0864.05063
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
33
1996
Induced subtrees in graphs of large chromatic number. Zbl 0475.05027
Gyarfas, A.; Szemeredi, E.; Tuza, Zs.
32
1980
On complete subgraphs of \(r\)-chromatic graphs. Zbl 0306.05121
Bollobás, Béla; Erdős, Paul; Szemerédi, E.
28
1975
How to avoid using the regularity Lemma: Pósa’s conjecture revisited. Zbl 1188.05080
Levitt, Ian; Sárközy, Gábor N.; Szemerédi, Endre
27
2010
On size Ramsey numbers of graphs with bounded degree. Zbl 0959.05076
Rödl, Vojtěch; Szemerédi, Endre
27
2000
On Turan’s theorem for sparse graphs. Zbl 0491.05038
Ajtai, M.; Erdős, Paul; Komlos, J.; Szemeredi, E.
26
1981
On the Pósa-Seymour conjecture. Zbl 0919.05042
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
26
1998
Sets of lattice points that form no squares. Zbl 0303.10046
Ajtai, M.; Szemerédi, E.
26
1975
Über ein Problem von Erdős und Moser. Zbl 0134.27801
Sárközy, A.; Szemerédi, E.
25
1965
Partitioning 3-colored complete graphs into three monochromatic cycles. Zbl 1217.05185
Gyárfás, András; Ruszinkó, Miklós; Sarközy, Gábor N.; Szemerédi, Endre
25
2011
On sets of natural numbers whose difference set contains no squares. Zbl 0651.10031
Pintz, János; Steiger, W. L.; Szemerédi, Endre
24
1988
First occurrence of Hamilton cycles in random graphs. Zbl 0577.05057
Ajtai, M.; Komlós, J.; Szemerédi, E.
24
1985
Tripartite Ramsey numbers for paths. Zbl 1122.05065
Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor N.; Szemerédi, Endre
23
2007
Dense graphs without 3-regular subgraphs. Zbl 0822.05037
Pyber, László; Rödl, Vojtěch; Szemerédi, Endre
23
1995
On a problem of Davenport and Schinzel. Zbl 0291.05003
Szemerédi, Endre
22
1974
Combinatorial properties of systems of sets. Zbl 0383.05002
Erdős, Paul; Szemerédi, E.
22
1978
On Heilbronn’s triangle problem. Zbl 0483.52007
Komlos, Janos; Pintz, Janos; Szemeredi, Endre
21
1981
The number of different distances determined by a set of points in the Euclidean plane. Zbl 0755.52005
Chung, Fan R. K.; Szemerédi, E.; Trotter, W. T.
21
1992
On a question of Erdős and Moser. Zbl 1155.11346
Sudakov, B.; Szemerédi, E.; Vu, V. H.
20
2005
Proof of a packing conjecture of Bollobás. Zbl 0842.05072
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
20
1995
Spanning trees in dense graphs. Zbl 0998.05012
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
20
2001
On a problem of graph theory. Zbl 0147.42804
Katona, G.; Szemerédi, E.
20
1967
Linear problems in combinatorial number theory. Zbl 0303.10058
Komlós, J.; Sulyok, M.; Szemerédi, E.
20
1975
Difference sets without \(\kappa\)-th powers. Zbl 0816.11014
Balog, A.; Pelikán, J.; Pintz, J.; Szemerédi, E.
20
1994
Sparse partition universal graphs for graphs of bounded degree. Zbl 1227.05196
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias; Szemerédi, Endre
19
2011
Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs. Zbl 1422.05077
Reiher, Christian; Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre
19
2019
On a conjecture of Loebl. Zbl 0844.05037
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
18
1995
On graphs containing no complete quadrangle. Zbl 0277.05134
Szemerédi, Endre
18
1973
Long arithmetic progressions in sumsets: thresholds and bounds. Zbl 1088.11012
Szemerédi, E.; Vu, V.
17
2006
On sparse graphs with dense long paths. Zbl 0328.05123
Erdős, Paul; Graham, Ronald L.; Szemerédi, E.
17
1975
The Ramsey number of diamond-matchings and loose cycles in hypergraphs. Zbl 1165.05334
Gyárfás, András; Sárközy, Gábor N.; Szemerédi, Endre
17
2008
Topological cliques in graphs. Zbl 0809.05080
Komlós, János; Szemerédi, Endre
16
1994
On the number of Hamiltonian cycles in Dirac graphs. Zbl 1013.05043
Sárközy, Gábor N.; Selkow, Stanley M.; Szemerédi, Endre
16
2003
Quadripartite version of the Hajnal-Szemerédi theorem. Zbl 1152.05037
Martin, Ryan; Szemerédi, Endre
16
2008
Girth of sparse graphs. Zbl 1176.05038
Bollobás, Béla; Szemerédi, Endre
15
2002
Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three. Zbl 1046.05040
Csaba, B.; Shokoufander, A.; Szemerédi, E.
15
2003
The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition. Zbl 1365.05141
Hladký, Jan; Komlós, János; Piguet, Diana; Simonovits, Miklós; Stein, Maya; Szemerédi, Endre
15
2017
On the Erdoes-Stone theorem. Zbl 0485.05034
Chvatal, V.; Szemeredi, E.
14
1981
Short cycles in directed graphs. Zbl 0545.05038
Chvátal, Václav; Szemerédi, E.
14
1983
On the number of monochromatic solutions of \(x+y=z^2\). Zbl 1093.11017
Khalfalah, Ayman; Szemerédi, Endre
14
2006
The approximate Loebl-Komlós-Sós conjecture IV: Embedding techniques and the proof of the main result. Zbl 1365.05144
Hladký, Jan; Komlós, János; Piguet, Diana; Simonovits, Miklós; Stein, Maya; Szemerédi, Endre
14
2017
On a conjecture of Erdős and Heilbronn. Zbl 0222.10055
Szemerédi, Endre
13
1970
Finite and infinite arithmetic progressions in sumsets. Zbl 1146.11006
Szemerédi, E.; Vu, V. H.
13
2006
The approximate Loebl-Komlós-Sós conjecture II: The rough structure of LKS graphs. Zbl 1365.05142
Hladký, Jan; Komlós, János; Piguet, Diana; Simonovits, Miklós; Stein, Maya; Szemerédi, Endre
13
2017
The approximate Loebl-Komlós-Sós conjecture III: The finer structure of LKS graphs. Zbl 1365.05143
Hladký, Jan; Komlós, János; Piguet, Diana; Simonovits, Miklós; Stein, Maya; Szemerédi, Endre
13
2017
Topological complete subgraphs in random graphs. Zbl 0489.05051
Ajtai, Miklos; Komlos, Janos; Szemeredi, Endre
11
1979
A combinatorial distinction between the Euclidean and projective planes. Zbl 0539.05026
Szemerédi, E.; Trotter, W. T. jun.
11
1983
Construction of a thin set with small Fourier coefficients. Zbl 0733.11005
Ajtai, Miklós; Iwaniec, Henryk; Komlós, János; Pintz, János; Szemerédi, Endre
11
1990
An upper bound on the number of planar \(K\)-sets. Zbl 0765.68211
Pach, János; Steiger, William; Szemerédi, Endre
11
1992
A lower bound for read-once-only branching programs. Zbl 0652.68062
Babai, László; Hajnal, Péter; Szemerédi, Endre; Turán, György
10
1987
Subset sums modulo a prime. Zbl 1136.11016
Nguyen, Hoi H.; Szemerédi, Endre; Vu, Van H.
10
2008
The analysis of double hashing. Zbl 0369.68020
Guibas, Leo J.; Szemerédi, Endre
10
1978
Constructing small sets that are uniform in arithmetic progressions. Zbl 0799.11022
Razborov, A.; Szemerédi, E.; Wigderson, A.
10
1993
Near-optimum universal graphs for graphs with bounded degrees (extended abstract). Zbl 1001.05086
Alon, Noga; Capalbo, Michael; Kohayakawa, Yoshiharu; Rödl, Vojtech; Rucinski, Andrzej; Szemerédi, Endre
10
2001
Optimal parallel selection has complexity O(log log N). Zbl 0668.68044
Ajtai, Miklós; Komlós, János; Steiger, W. L.; Szemerédi, Endre
9
1989
On the difference of consecutive terms of sequences defined by divisibility properties. II. Zbl 0266.10045
Szemerédi, Endre
9
1973
Turán-Ramsey theorems and simple asymptotically extremal structures. Zbl 0774.05050
Erdős, Paul; Hajnal, András; Simonovits, Miklós.; Sós, V. T.; Szemerédi, E.
9
1993
On distinct consecutive differences. Zbl 1509.11012
Ruzsa, Imre; Shakan, George; Solymosi, József; Szemerédi, Endre
1
2021
Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs. Zbl 1422.05077
Reiher, Christian; Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre
19
2019
Embedding graphs into larger graphs: results, methods, and problems. Zbl 1443.05100
Simonovits, Miklós; Szemerédi, Endre
2
2019
Two geometrical applications of the semi-random method. Zbl 1414.05210
Hajnal, Péter; Szemerédi, Endre
1
2018
The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition. Zbl 1365.05141
Hladký, Jan; Komlós, János; Piguet, Diana; Simonovits, Miklós; Stein, Maya; Szemerédi, Endre
15
2017
The approximate Loebl-Komlós-Sós conjecture IV: Embedding techniques and the proof of the main result. Zbl 1365.05144
Hladký, Jan; Komlós, János; Piguet, Diana; Simonovits, Miklós; Stein, Maya; Szemerédi, Endre
14
2017
The approximate Loebl-Komlós-Sós conjecture II: The rough structure of LKS graphs. Zbl 1365.05142
Hladký, Jan; Komlós, János; Piguet, Diana; Simonovits, Miklós; Stein, Maya; Szemerédi, Endre
13
2017
The approximate Loebl-Komlós-Sós conjecture III: The finer structure of LKS graphs. Zbl 1365.05143
Hladký, Jan; Komlós, János; Piguet, Diana; Simonovits, Miklós; Stein, Maya; Szemerédi, Endre
13
2017
On the Hamiltonicity of triple systems with high minimum degree. Zbl 1359.05089
Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre
6
2017
Structural approach to subset sum problems. Zbl 1428.11024
Szemerédi, Endre
2
2016
Erdős’s unit distance problem. Zbl 1354.52019
Szemerédi, Endre
1
2016
The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs. Zbl 1332.05074
Szemerédi, Endre; Stein, Maya; Simonovits, Miklós; Piguet, Diana; Hladký, Jan
7
2015
Arithmetic progressions, different regularity lemmas and removal lemmas. Zbl 1397.11019
Szemerédi, Endre
2
2015
Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs. Zbl 1220.05083
Rödl, Vojtech; Ruciński, Andrzej; Szemerédi, Endre
37
2011
Partitioning 3-colored complete graphs into three monochromatic cycles. Zbl 1217.05185
Gyárfás, András; Ruszinkó, Miklós; Sarközy, Gábor N.; Szemerédi, Endre
25
2011
Sparse partition universal graphs for graphs of bounded degree. Zbl 1227.05196
Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias; Szemerédi, Endre
19
2011
A fast algorithm for equitable coloring. Zbl 1224.05176
Kierstead, Henry A.; Kostochka, Alexandr V.; Mydlarz, Marcelo; Szemerédi, Endre
35
2010
How to avoid using the regularity Lemma: Pósa’s conjecture revisited. Zbl 1188.05080
Levitt, Ian; Sárközy, Gábor N.; Szemerédi, Endre
27
2010
Monochromatic matchings in the shadow graph of almost complete hypergraphs. Zbl 1235.05051
Gyárfás, András; Sárközy, Gábor N.; Szemerédi, Endre
8
2010
Long monochromatic Berge cycles in colored 4-uniform hypergraphs. Zbl 1221.05141
Gyárfás, András; Sárközy, Gábor N.; Szemerédi, Endre
7
2010
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. Zbl 1223.05164
Gyárfás, András; Sárközy, Gábor N.; Szemerédi, Endre
5
2010
Tight bounds for embedding bounded degree trees. Zbl 1225.05140
Csaba, Béla; Levitt, Ian; Nagy-György, Judit; Szemerédi, Endre
5
2010
Perfect matchings in large uniform hypergraphs with large minimum collective degree. Zbl 1214.05130
Rödl, Vojtech; Ruciński, Andrzej; Szemerédi, Endre
74
2009
Stability of the path-path Ramsey number. Zbl 1192.05091
Gyárfás, András; Sárközy, Gábor N.; Szemerédi, Endre
6
2009
An approximate Dirac-type theorem for \(k\)-uniform hypergraphs. Zbl 1164.05051
Rödl, Vojtěch; Ruciński, Andrzej; Szemerédi, Endre
78
2008
The Ramsey number of diamond-matchings and loose cycles in hypergraphs. Zbl 1165.05334
Gyárfás, András; Sárközy, Gábor N.; Szemerédi, Endre
17
2008
Quadripartite version of the Hajnal-Szemerédi theorem. Zbl 1152.05037
Martin, Ryan; Szemerédi, Endre
16
2008
Subset sums modulo a prime. Zbl 1136.11016
Nguyen, Hoi H.; Szemerédi, Endre; Vu, Van H.
10
2008
A note on perfect matchings in uniform hypergraphs with large minimum collective degree. Zbl 1212.05215
Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre
6
2008
Three-color Ramsey numbers for paths. Zbl 1175.05093
Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor N.; Szemerédi, Endre
50
2007
Tripartite Ramsey numbers for paths. Zbl 1122.05065
Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor N.; Szemerédi, Endre
23
2007
An old new proof of Roth’s theorem. Zbl 1219.11018
Szemerédi, Endre
2
2007
A Dirac-type theorem for 3-uniform hypergraphs. Zbl 1082.05057
Rödl, Vojtěch; Ruciński, Andrzej; Szemerédi, Endre
114
2006
An improved bound for the monochromatic cycle partition number. Zbl 1115.05031
Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor N.; Szemerédi, Endre
44
2006
Perfect matchings in uniform hypergraphs with large minimum degree. Zbl 1104.05051
Rödl, Vojtech; Ruciński, Andrzej; Szemerédi, Endre
40
2006
Long arithmetic progressions in sumsets: thresholds and bounds. Zbl 1088.11012
Szemerédi, E.; Vu, V.
17
2006
On the number of monochromatic solutions of \(x+y=z^2\). Zbl 1093.11017
Khalfalah, Ayman; Szemerédi, Endre
14
2006
Finite and infinite arithmetic progressions in sumsets. Zbl 1146.11006
Szemerédi, E.; Vu, V. H.
13
2006
One-sided coverings of colored complete bipartite graphs. Zbl 1118.05067
Gyárfás, András; Ruszinkó, Miklós; Sárkőzy, Gábor N.; Szemerédi, Endre
8
2006
Short paths in quasi-random triple systems with sparse underlying graphs. Zbl 1091.05009
Polcyn, Joanna; Rödl, Vojtech; Ruciński, Andrzej; Szemerédi, Endre
4
2006
Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint). Zbl 1099.05072
Komlós, János; Szemerédi, Endre
3
2006
On a question of Erdős and Moser. Zbl 1155.11346
Sudakov, B.; Szemerédi, E.; Vu, V. H.
20
2005
Long arithmetic progressions in sum-sets and the number of \(x\)-sum-free sets. Zbl 1073.11008
Szemerédi, E.; Vu, V. H.
8
2005
On the number of Hamiltonian cycles in Dirac graphs. Zbl 1013.05043
Sárközy, Gábor N.; Selkow, Stanley M.; Szemerédi, Endre
16
2003
Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three. Zbl 1046.05040
Csaba, B.; Shokoufander, A.; Szemerédi, E.
15
2003
The regularity lemma and its applications in graph theory. Zbl 1054.68103
Komlós, János; Shokoufandeh, Ali; Simonovits, Miklós; Szemerédi, Endre
36
2002
Girth of sparse graphs. Zbl 1176.05038
Bollobás, Béla; Szemerédi, Endre
15
2002
Tight bound for the density of sequence of integers the sum of no two of which is a perfect square. Zbl 1066.11004
Khalfalah, A.; Lodha, S.; Szemerédi, E.
1
2002
Proof of the Alon-Yuster conjecture. Zbl 0977.05106
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
70
2001
Spanning trees in dense graphs. Zbl 0998.05012
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
20
2001
Near-optimum universal graphs for graphs with bounded degrees (extended abstract). Zbl 1001.05086
Alon, Noga; Capalbo, Michael; Kohayakawa, Yoshiharu; Rödl, Vojtech; Rucinski, Andrzej; Szemerédi, Endre
10
2001
On size Ramsey numbers of graphs with bounded degree. Zbl 0959.05076
Rödl, Vojtěch; Szemerédi, Endre
27
2000
Proof of the Seymour conjecture for large graphs. Zbl 0917.05043
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
70
1998
Partitioning two-coloured complete graphs into two monochromatic cycles. Zbl 0916.05025
Łuczak, Tomasz; Rödl, Vojtěch; Szemerédi, Endre
45
1998
An algorithmic version of the blow-up lemma. Zbl 0917.05071
Komlós, János; Sárközy, Gabor N.; Szemerédi, Endre
36
1998
On the Pósa-Seymour conjecture. Zbl 0919.05042
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
26
1998
Matching nuts and bolts in \(O(n \log n)\) time. Zbl 0911.68069
Komlós, János; Ma, Yuan; Szemerédi, Endre
3
1998
Blow-up lemma. Zbl 0880.05049
Komlós, J.; Sárközy, G. N.; Szemerédi, E.
133
1997
Turán-Ramsey theorems and \(K_p\)-independence numbers. Zbl 0876.05050
Erdős, Pál; Hajnal, András; Simonovits, Miklós; Sós, Vera T.; Szemerédi, Endre
2
1997
Topological cliques in graphs. II. Zbl 0846.05023
Komloś, János; Szemerédi, Endre
57
1996
On the square of a Hamiltonian cycle in dense graphs. Zbl 0864.05063
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
33
1996
Matching nuts and bolts in \(O(n\log n)\) time. (Extended abstract). Zbl 0852.68018
Komlós, János; Ma, Yuan; Szemerédi, Endre
2
1996
On the probability that a random \(\pm 1\)-matrix is singular. Zbl 0829.15018
Kahn, Jeff; Komlós, János; Szemerédi, Endre
69
1995
Dense graphs without 3-regular subgraphs. Zbl 0822.05037
Pyber, László; Rödl, Vojtěch; Szemerédi, Endre
23
1995
Proof of a packing conjecture of Bollobás. Zbl 0842.05072
Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre
20
1995
On a conjecture of Loebl. Zbl 0844.05037
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
18
1995
Lower bounds for sorting networks. Zbl 0968.68508
Kahale, Nabil; Leighton, Tom; Ma, Yuan; Plaxton, C. Greg; Suel, Torsten; Szemerédi, Endre
2
1995
A statistical theorem of set addition. Zbl 0812.11017
Balog, Antal; Szemerédi, Endre
49
1994
Difference sets without \(\kappa\)-th powers. Zbl 0816.11014
Balog, A.; Pelikán, J.; Pintz, J.; Szemerédi, E.
20
1994
Topological cliques in graphs. Zbl 0809.05080
Komlós, János; Szemerédi, Endre
16
1994
Turán-Ramsey theorems and \(K_p\)-independence numbers. Zbl 0812.05031
Erdős, Paul; Hajnal, András; Simonovits, Miklós; Sós, Vera T.; Szemerédi, E.
8
1994
On a problem in additive number theory. Zbl 0816.11013
Sárközy, A.; Szemerédi, E.
7
1994
Constructing small sets that are uniform in arithmetic progressions. Zbl 0799.11022
Razborov, A.; Szemerédi, E.; Wigderson, A.
10
1993
Turán-Ramsey theorems and simple asymptotically extremal structures. Zbl 0774.05050
Erdős, Paul; Hajnal, András; Simonovits, Miklós.; Sós, V. T.; Szemerédi, E.
9
1993
Two tapes versus one for off-line Turing machines. Zbl 0802.68048
Maass, Wolfgang; Schnitger, Georg; Szemerédi, Endre; Turán, György
2
1993
The number of different distances determined by a set of points in the Euclidean plane. Zbl 0755.52005
Chung, Fan R. K.; Szemerédi, E.; Trotter, W. T.
21
1992
An upper bound on the number of planar \(K\)-sets. Zbl 0765.68211
Pach, János; Steiger, William; Szemerédi, Endre
11
1992
Undirected connectivity in \(O(\log^{1. 5} n)\) space. Zbl 0915.05081
Nisan, Noam; Szemeredi, Endre; Wigderson, Avi
8
1992
Fault tolerant graphs, perfect hash functions and disjoint paths. Zbl 0977.68557
Ajtai, M.; Alon, N.; Bruck, J.; Cypher, R.; Ho, C. T.; Naor, M.; Szemerédi, E.
3
1992
Halvers and expanders. Zbl 0977.68531
Ajtai, Miklós; Komlós, János; Szemerédi, Endre
2
1992
Integer sets containing no arithmetic progressions. Zbl 0721.11007
Szemerédi, E.
40
1990
Construction of a thin set with small Fourier coefficients. Zbl 0733.11005
Ajtai, Miklós; Iwaniec, Henryk; Komlós, János; Pintz, János; Szemerédi, Endre
11
1990
Lower bounds to the complexity of symmetric Boolean functions. Zbl 0701.68044
Babai, L.; Pudlák, P.; Rödl, Vojtěch; Szemeredi, E.
8
1990
Brooks coloring in parallel. Zbl 0689.68057
Hajnal, Péter; Szemerédi, Endre
3
1990
An optimal-time algorithm for slope selection. Zbl 0678.68033
Cole, Richard; Salowe, Jeffrey S.; Steiger, W. L.; Szemerédi, Endre
41
1989
Optimal parallel selection has complexity O(log log N). Zbl 0668.68044
Ajtai, Miklós; Komlós, János; Steiger, W. L.; Szemerédi, Endre
9
1989
Sorting in average time o(log n). Zbl 0673.68041
Ajtai, M.; Karabeg, D.; Komlós, J.; Szemerédi, E.
6
1989
On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines. Zbl 0676.68019
Galil, Zvi; Kannan, Ravi; Szemerédi, Endre
6
1989
On 3-pushdown graphs with large separators. Zbl 0726.05042
Galil, Z.; Kannan, R.; Szemerédi, E.
4
1989
Infinite sets of primes with fast primality tests and quick generation of large primes. Zbl 0674.10001
Pintz, János; Steiger, William L.; Szemerédi, Endre
2
1989
There are no p-complete families of symmetric Boolean functions. Zbl 0662.94023
Geréb-Graus, Mihály; Paturi, Ramamohan; Szemerédi, Endre
1
1989
Many hard examples for resolution. Zbl 0712.03008
Chvátal, Vašek; Szemerédi, Endre
94
1988
On sets of natural numbers whose difference set contains no squares. Zbl 0651.10031
Pintz, János; Steiger, W. L.; Szemerédi, Endre
24
1988
The parallel complexity of element distinctness is \(\Omega\) (\(\sqrt{\log \,n})\). Zbl 0655.68042
Ragde, Prabhakar; Steiger, William; Szemerédi, Endre; Wigderson, Avi
7
1988
A lower bound for read-once-only branching programs. Zbl 0652.68062
Babai, László; Hajnal, Péter; Szemerédi, Endre; Turán, György
10
1987
First occurrence of Hamilton cycles in random graphs. Zbl 0577.05057
Ajtai, M.; Komlós, J.; Szemerédi, E.
24
1985
On the sum of the reciprocals of cycle lengths in sparse graphs. Zbl 0582.05039
Gyárfás, A.; Prömel, H. J.; Szemerédi, E.; Voigt, B.
1
1985
Storing a sparse table with O(1) worst case access time. Zbl 0629.68068
Fredman, Michael L.; Komlós, János; Szemerédi, Endre
142
1984
Unit distances in the Euclidean plane. Zbl 0561.52008
Spencer, J.; Szemerédi, E.; Trotter, W. jun.
48
1984
On the distribution of cycle lengths in graphs. Zbl 0551.05058
Gyárfás, A.; Komlós, J.; Szemerédi, E.
7
1984
...and 71 more Documents
all top 5

Cited by 3,216 Authors

82 Sudakov, Benny
68 Rodl, Vojtech
66 Fox, Jacob
58 Alon, Noga
54 Krivelevich, Michael
50 Szemerédi, Endre
48 Pach, János
43 Sharir, Micha
42 Sarkozy, Gabor N.
40 Han, Jie
38 Erdős, Pál
37 Tao, Terence
35 Osthus, Deryk
34 Kühn, Daniela
32 Gyárfás, András
30 Conlon, David
30 Kohayakawa, Yoshiharu
30 Mubayi, Dhruv
29 Balogh, József
29 Kostochka, Aleksandr Vasil’evich
28 Bollobás, Béla
27 Vũ Hà Văn
26 Schacht, Mathias
25 Shkredov, Il’ya Dmitrievich
24 Treglown, Andrew
24 Zhao, Yi
23 Stein, Maya Jakobine
22 Bergelson, Vitaly
22 Ruciński, Andrzej
21 Frieze, Alan Michael
21 Kierstead, Henry A.
20 Ferber, Asaf
20 Lo, Allan Siu Lun
19 Böttcher, Julia
19 Suk, Andrew
19 Tóth, Csaba D.
18 Lefmann, Hanno
18 Li, Yusheng
18 Scott, Alexander D.
17 Furedi, Zoltan
17 Shapira, Asaf
17 Tuza, Zsolt
16 Dumitrescu, Adrian
16 Kim, Jaehoon
16 Liu, Hong
16 Mycroft, Richard
16 Nenadov, Rajko
16 Samotij, Wojciech
16 Skokan, Jozef
16 Solymosi, József
15 Łuczak, Tomasz
15 Molla, Theodore
15 Simonovits, Miklós
15 Verstraëte, Jacques
15 Yuster, Raphael
15 Zhao, Yufei
14 Hefetz, Dan
14 Keevash, Peter
14 Komlós, János
14 Person, Yury Aleksandrovic
14 Roche-Newton, Oliver
14 Sheffer, Adam
14 Tóth, Géza
13 Debiasio, Louis
13 Frankl, Péter
13 Joos, Felix Claudius
13 Lin, Qizhong
13 Piguet, Diana
13 Rudnev, Misha
13 Schoen, Tomasz
13 Wang, Guanghui
13 Wood, David Ronald
12 Chung, Fan
12 Gishboliner, Lior
12 Graham, Ronald Lewis
12 Hladký, Jan
12 Lee, Choongbum
12 Taraz, Anusch
11 Bohman, Tom
11 Dudek, Andrzej
11 He, Xiaoyu
11 Kwan, Matthew
11 Mohar, Bojan
11 Nagle, Brendan
11 Ruzsa, Imre Z.
11 Sárközy, András
11 Tomon, István
10 Bourgain, Jean
10 Bucić, Matija
10 Cooley, Oliver
10 Dvořák, Zdeněk
10 Glock, Stefan
10 Green, Ben Joseph
10 Iosevich, Alex
10 Kang, Ross J.
10 Lehel, Jeno
10 Morris, Robert D.
10 Mota, Guilherme Oliveira
10 Nguyen, Hoi H.
10 Pissis, Solon P.
...and 3,116 more Authors
all top 5

Cited in 308 Serials

238 Discrete Mathematics
163 Journal of Combinatorial Theory. Series B
142 Random Structures & Algorithms
130 Combinatorics, Probability and Computing
110 Combinatorica
107 European Journal of Combinatorics
106 SIAM Journal on Discrete Mathematics
95 Journal of Combinatorial Theory. Series A
94 Graphs and Combinatorics
91 Theoretical Computer Science
89 The Electronic Journal of Combinatorics
84 Discrete Applied Mathematics
80 Journal of Graph Theory
73 Discrete & Computational Geometry
68 Information Processing Letters
58 Israel Journal of Mathematics
42 Advances in Mathematics
42 Computational Geometry
40 Journal of Computer and System Sciences
39 Algorithmica
38 Journal of Number Theory
34 Proceedings of the American Mathematical Society
29 Transactions of the American Mathematical Society
25 Discrete Analysis
22 Acta Mathematica Hungarica
21 Information and Computation
20 SIAM Journal on Computing
19 Annals of Mathematics. Second Series
18 Geometric and Functional Analysis. GAFA
17 Journal d’Analyse Mathématique
17 Computational Complexity
16 Journal of the American Mathematical Society
16 Bulletin of the American Mathematical Society. New Series
16 Forum of Mathematics, Sigma
15 Duke Mathematical Journal
13 Mathematical Proceedings of the Cambridge Philosophical Society
13 Bulletin of the London Mathematical Society
13 Journal of the London Mathematical Society. Second Series
12 Mathematika
11 Acta Arithmetica
11 Journal of Combinatorial Optimization
10 Artificial Intelligence
10 The Annals of Probability
10 Linear Algebra and its Applications
10 Journal of the European Mathematical Society (JEMS)
9 Mathematical Notes
9 Finite Fields and their Applications
9 Oberwolfach Reports
9 International Journal of Number Theory
7 Periodica Mathematica Hungarica
7 Inventiones Mathematicae
7 Mathematical Systems Theory
7 SIAM Journal on Algebraic and Discrete Methods
7 Annals of Pure and Applied Logic
7 Designs, Codes and Cryptography
7 Journal of Mathematical Sciences (New York)
7 Annals of Mathematics and Artificial Intelligence
7 Discussiones Mathematicae. Graph Theory
7 Theory of Computing Systems
7 Annals of Combinatorics
7 Integers
7 Forum of Mathematics, Pi
6 American Mathematical Monthly
6 Acta Mathematicae Applicatae Sinica. English Series
6 International Journal of Computational Geometry & Applications
6 International Journal of Foundations of Computer Science
5 Applied Mathematics and Computation
5 Memoirs of the American Mathematical Society
5 Probability Theory and Related Fields
5 Aequationes Mathematicae
5 International Journal of Computer Mathematics
5 Electronic Journal of Probability
5 The Journal of Fourier Analysis and Applications
4 Acta Informatica
4 Bulletin of the Australian Mathematical Society
4 Computers & Mathematics with Applications
4 Journal of Mathematical Analysis and Applications
4 Mathematics of Computation
4 BIT
4 Compositio Mathematica
4 Journal of Functional Analysis
4 Mathematische Annalen
4 Advances in Applied Mathematics
4 Ergodic Theory and Dynamical Systems
4 Revista Matemática Iberoamericana
4 Annals of Operations Research
4 Annales de l’Institut Henri Poincaré. Probabilités et Statistiques
4 Distributed Computing
4 Indagationes Mathematicae. New Series
4 Journal of Algebraic Combinatorics
4 Journal de Théorie des Nombres de Bordeaux
4 Sbornik: Mathematics
4 RAIRO. Theoretical Informatics and Applications
4 Journal of the Australian Mathematical Society
4 Comptes Rendus. Mathématique. Académie des Sciences, Paris
4 ACM Transactions on Computational Logic
4 Science China. Mathematics
3 Rocky Mountain Journal of Mathematics
3 Archiv der Mathematik
3 Bulletin de la Société Mathématique de France
...and 208 more Serials
all top 5

Cited in 51 Fields

1,986 Combinatorics (05-XX)
769 Computer science (68-XX)
521 Number theory (11-XX)
209 Convex and discrete geometry (52-XX)
177 Probability theory and stochastic processes (60-XX)
94 Information and communication theory, circuits (94-XX)
91 Mathematical logic and foundations (03-XX)
80 Dynamical systems and ergodic theory (37-XX)
78 Operations research, mathematical programming (90-XX)
68 Group theory and generalizations (20-XX)
67 Linear and multilinear algebra; matrix theory (15-XX)
64 Geometry (51-XX)
58 Measure and integration (28-XX)
42 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
31 Harmonic analysis on Euclidean spaces (42-XX)
29 Algebraic geometry (14-XX)
28 Numerical analysis (65-XX)
22 General and overarching topics; collections (00-XX)
21 Topological groups, Lie groups (22-XX)
19 Order, lattices, ordered algebraic structures (06-XX)
17 Statistical mechanics, structure of matter (82-XX)
15 Quantum theory (81-XX)
14 General topology (54-XX)
12 Statistics (62-XX)
11 Functional analysis (46-XX)
8 History and biography (01-XX)
8 Commutative algebra (13-XX)
7 Abstract harmonic analysis (43-XX)
7 Biology and other natural sciences (92-XX)
6 Differential geometry (53-XX)
6 Manifolds and cell complexes (57-XX)
5 Field theory and polynomials (12-XX)
5 Approximations and expansions (41-XX)
5 Operator theory (47-XX)
5 Systems theory; control (93-XX)
4 Functions of a complex variable (30-XX)
4 Difference and functional equations (39-XX)
3 Algebraic topology (55-XX)
2 Associative rings and algebras (16-XX)
2 Nonassociative rings and algebras (17-XX)
2 Real functions (26-XX)
2 Several complex variables and analytic spaces (32-XX)
2 Partial differential equations (35-XX)
2 Sequences, series, summability (40-XX)
2 Global analysis, analysis on manifolds (58-XX)
2 Mechanics of particles and systems (70-XX)
1 General algebraic systems (08-XX)
1 Ordinary differential equations (34-XX)
1 Integral equations (45-XX)
1 Calculus of variations and optimal control; optimization (49-XX)
1 Fluid mechanics (76-XX)

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.