Year |
Citation |
Score |
2019 |
Reiher C, Rödl V, Ruciński A, Schacht M, Szemerédi E. Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs Proceedings of the London Mathematical Society. 119: 409-439. DOI: 10.1112/Plms.12235 |
0.408 |
|
2017 |
Hladký J, Komlós J, Piguet D, Simonovits M, Stein M, Szemerédi E. The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result Siam Journal On Discrete Mathematics. 31: 1072-1148. DOI: 10.1137/140982878 |
0.437 |
|
2017 |
Hladký J, Komlós J, Piguet D, Simonovits M, Stein MJ, Szemerédi E. The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs Siam Journal On Discrete Mathematics. 31: 1017-1071. DOI: 10.1137/140982866 |
0.422 |
|
2017 |
Hladký J, Komlós J, Piguet D, Simonovits M, Stein MJ, Szemerédi E. The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs Siam Journal On Discrete Mathematics. 31: 983-1016. DOI: 10.1137/140982854 |
0.438 |
|
2017 |
Hladký J, Komlós J, Piguet D, Simonovits M, Stein MJ, Szemerédi E. The approximate Loebl-Komlos-Sos Conjecture I: The sparse decomposition Siam Journal On Discrete Mathematics. 31: 945-982. DOI: 10.1137/140982842 |
0.451 |
|
2017 |
Rödl V, Ruciński A, Schacht M, Szemerédi E. On the Hamiltonicity of Triple Systems with High Minimum Degree Annals of Combinatorics. 21: 95-117. DOI: 10.1007/S00026-017-0345-1 |
0.314 |
|
2015 |
Hladký J, Piguet D, Simonovits M, Stein M, Szemerédi E. The Approximate Loebl-Komlos-Sos Conjecture And Embedding Trees In Sparse Graphs Electronic Research Announcements in Mathematical Sciences. 22: 1-11. DOI: 10.3934/Era.2015.22.1 |
0.485 |
|
2011 |
Gyárfás A, Ruszinkó M, Sárközy GN, Szemerédi E. Partitioning 3-colored complete graphs into three monochromatic cycles ∗ Electronic Journal of Combinatorics. 18: 53. DOI: 10.37236/540 |
0.457 |
|
2011 |
Rödl V, Ruciński A, Szemerédi E. Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs Advances in Mathematics. 227: 1225-1299. DOI: 10.1016/J.Aim.2011.03.007 |
0.456 |
|
2011 |
Kohayakawa Y, Rödl V, Schacht M, Szemerédi E. Sparse partition universal graphs for graphs of bounded degree Advances in Mathematics. 226: 5041-5065. DOI: 10.1016/J.Aim.2011.01.004 |
0.475 |
|
2010 |
Levitt I, Sárközy GN, Szemerédi E. How to avoid using the Regularity Lemma: Pósa's conjecture revisited Discrete Mathematics. 310: 630-641. DOI: 10.1016/J.Disc.2009.05.020 |
0.773 |
|
2010 |
Kierstead HA, Kostochka AV, Mydlarz M, Szemerédi E. A fast algorithm for equitable coloring Combinatorica. 30: 217-224. DOI: 10.1007/S00493-010-2483-5 |
0.722 |
|
2010 |
Gyárfás A, Sárközy GN, Szemerédi E. Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs Graphs and Combinatorics. 26: 71-76. DOI: 10.1007/S00373-010-0908-Y |
0.441 |
|
2010 |
Gyárfás A, Sárközy GN, Szemerédi E. Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs Annals of Combinatorics. 14: 245-249. DOI: 10.1007/S00026-010-0058-1 |
0.421 |
|
2009 |
Rödl V, Ruciński A, Szemerédi E. Perfect matchings in large uniform hypergraphs with large minimum collective degree Journal of Combinatorial Theory, Series A. 116: 613-636. DOI: 10.1016/J.Jcta.2008.10.002 |
0.4 |
|
2009 |
Gyárfás A, Sárközy GN, Szemerédi E. Stability of the path-path Ramsey number Discrete Mathematics. 309: 4590-4595. DOI: 10.1016/J.Disc.2009.02.025 |
0.464 |
|
2008 |
Nguyen HH, Szemerédi E, Vu VH. Subset sums modulo a prime Acta Arithmetica. 131: 303-316. DOI: 10.4064/Aa131-4-1 |
0.308 |
|
2008 |
Gyárfás A, Sárközy GN, Szemerédi E. The Ramsey number of diamond-matchings and loose cycles in hypergraphs Electronic Journal of Combinatorics. 15: 126. DOI: 10.37236/850 |
0.328 |
|
2008 |
Martin R, Szemerédi E. Quadripartite version of the Hajnal-Szemerédi theorem Discrete Mathematics. 308: 4337-4360. DOI: 10.1016/J.Disc.2007.08.019 |
0.483 |
|
2008 |
Gyárfás A, Ruszinkó M, Sárközy GN, Szemerédi E. Three-color Ramsey numbers for paths Combinatorica. 27: 499-502. DOI: 10.1007/S00493-008-2395-9 |
0.395 |
|
2008 |
Rödl V, Szemerédi E, Ruciński A. An approximate Dirac-type theorem for k-uniform hypergraphs Combinatorica. 28: 229-260. DOI: 10.1007/S00493-008-2295-Z |
0.47 |
|
2007 |
Gyárfás A, Ruszinkó M, Sárközy GN, Szemerédi E. Tripartite Ramsey numbers for paths Journal of Graph Theory. 55: 164-174. DOI: 10.1002/Jgt.V55:2 |
0.416 |
|
2006 |
Szemerédi E, Vu VH. Finite and infinite arithmetic progressions in sumsets Annals of Mathematics. 163: 1-35. DOI: 10.4007/Annals.2006.163.1 |
0.383 |
|
2006 |
Khalfalah A, Szemerédi E. On the Number of Monochromatic Solutions of x+y=z 2 Combinatorics, Probability & Computing. 15: 213-227. DOI: 10.1017/S0963548305007169 |
0.617 |
|
2006 |
RÖDL V, RUCINSKI A, SZEMERÉDI E. A Dirac-Type Theorem for 3-Uniform Hypergraphs Combinatorics, Probability and Computing. 15: 229. DOI: 10.1017/S0963548305007042 |
0.485 |
|
2006 |
Gyárfás A, Ruszinkó M, Sárközy GN, Szemerédi E. An improved bound for the monochromatic cycle partition number Journal of Combinatorial Theory, Series B. 96: 855-873. DOI: 10.1016/J.Jctb.2006.02.007 |
0.483 |
|
2006 |
Polcyn J, Rödl V, Ruciński A, Szemerédi E. Short paths in quasi-random triple systems with sparse underlying graphs Journal of Combinatorial Theory, Series B. 96: 584-607. DOI: 10.1016/J.Jctb.2005.12.002 |
0.402 |
|
2006 |
Rödl V, Ruciński A, Szemerédi E. Perfect matchings in uniform hypergraphs with large minimum degree European Journal of Combinatorics. 27: 1333-1349. DOI: 10.1016/J.Ejc.2006.05.008 |
0.464 |
|
2005 |
Szemerédi E, Vu VH. Long Arithmetic Progressions in Sum‐Sets and the Number x‐Sum‐Free Sets Proceedings of the London Mathematical Society. 90: 273-296. DOI: 10.1112/S0024611504015059 |
0.427 |
|
2005 |
Szemerédi E, Vu V. Long arithmetic progressions in sumsets: Thresholds and bounds Journal of the American Mathematical Society. 19: 119-169. DOI: 10.1090/S0894-0347-05-00502-3 |
0.431 |
|
2003 |
Sárközy GN, Selkow SM, Szemerédi E. On the number of Hamiltonian cycles in Dirac graphs Discrete Mathematics. 265: 237-250. DOI: 10.1016/S0012-365X(02)00582-4 |
0.463 |
|
2003 |
Csaba B, Shokoufandeh A, Szemerédi E. Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three Combinatorica. 23: 35-72. DOI: 10.1007/S00493-003-0013-4 |
0.606 |
|
2002 |
Khalfalah A, Lodha S, Szemerédi E. Tight bound for the density of sequence of integers the sum of no two of which is a perfect square Discrete Mathematics. 256: 243-255. DOI: 10.1016/S0012-365X(01)00435-6 |
0.742 |
|
2002 |
Komlós J, Shokoufandeh A, Simonovits M, Szemerédi E. The Regularity Lemma and Its Applications in Graph Theory Lecture Notes in Computer Science. 84-112. DOI: 10.1007/3-540-45878-6_3 |
0.412 |
|
2002 |
Bollobás B, Szemerédi E. Girth of sparse graphs Journal of Graph Theory. 39: 194-200. DOI: 10.1002/Jgt.V39:3 |
0.497 |
|
2002 |
Bollobás B, Szemerédi E. Girth of sparse graphs: GIRTH OF SPARSE GRAPHS Journal of Graph Theory. 39: 194-200. DOI: 10.1002/Jgt.10023 |
0.385 |
|
2001 |
Komlós J, Sárkózy GN, Szemerédi E. Spanning Trees in Dense Graphs Combinatorics, Probability & Computing. 10: 397-416. DOI: 10.1017/S0963548301004849 |
0.479 |
|
2001 |
Komlós J, Sárközy GN, Szemerédi E. Proof of the Alon—Yuster conjecture Discrete Mathematics. 235: 255-269. DOI: 10.1016/S0012-365X(00)00279-X |
0.341 |
|
2000 |
Rödl V, Szemerédi E. On Size Ramsey Numbers of Graphs with Bounded Degree Combinatorica. 20: 257-262. DOI: 10.1007/S004930070024 |
0.408 |
|
1998 |
Komlós J, Ma Y, Szemerédi E. Matching Nuts and Bolts in O ( n log n ) Time Siam Journal On Discrete Mathematics. 11: 347-372. DOI: 10.1137/S0895480196304982 |
0.403 |
|
1998 |
ŁUCZAK T, RÖDL V, SZEMERÉDI E. Partitioning Two-Coloured Complete Graphs into
Two Monochromatic Cycles Combinatorics, Probability and Computing. 7: 423-436. DOI: 10.1017/S0963548398003599 |
0.489 |
|
1998 |
Komlós J, Sárközy GN, Szemerédi E. Proof of the Seymour conjecture for large graphs Annals of Combinatorics. 2: 43-60. DOI: 10.1007/Bf01626028 |
0.475 |
|
1998 |
Komlós J, Sarkozy GN, Szemerédi E. An algorithmic version of the blow-up lemma Random Structures and Algorithms. 12: 297-312. DOI: 10.1002/(Sici)1098-2418(199805)12:3<297::Aid-Rsa5>3.0.Co;2-Q |
0.458 |
|
1998 |
Komlós J, Sárközy GN, Szemerédi E. On the Pósa-Seymour conjecture Journal of Graph Theory. 29: 167-176. DOI: 10.1002/(Sici)1097-0118(199811)29:3<>1.0.Co;2-E |
0.48 |
|
1997 |
Komlós J, Sárközy GN, Szemerédi E. Blow-up Lemma Combinatorica. 17: 109-123. DOI: 10.1007/Bf01196135 |
0.408 |
|
1996 |
Komlós J, Sárközy GN, Szemerédi E. On the square of a Hamiltonian cycle in dense graphs Random Structures and Algorithms. 9: 193-211. DOI: 10.1002/(Sici)1098-2418(199608/09)9:1/2<193::Aid-Rsa12>3.0.Co;2-P |
0.49 |
|
1995 |
Komlós J, Sárközy GN, Szemerédi E. Proof of a Packing Conjecture of Bollobás Combinatorics, Probability & Computing. 4: 241-255. DOI: 10.1017/S0963548300001620 |
0.483 |
|
1995 |
Pyber L, Rodl V, Szemeredi E. Dense Graphs without 3-Regular Subgraphs Journal of Combinatorial Theory, Series B. 63: 41-54. DOI: 10.1006/Jctb.1995.1004 |
0.45 |
|
1994 |
Komlós J, Szemerédi E. Topological Cliques in Graphs Combinatorics, Probability & Computing. 5: 79-90. DOI: 10.1017/S096354830000184X |
0.427 |
|
1994 |
Erdős P, Hajnal A, Simonovits M, Sós VT, Szemerédi E. Turán-Ramsey Theorems and Kp-Independence Numbers Combinatorics, Probability and Computing. 3: 297-325. DOI: 10.1017/S0963548300001218 |
0.484 |
|
1993 |
Razborov A, Szemerédi E, Wigderson A. Constructing Small Sets that are Uniform in Arithmetic Progressions Combinatorics, Probability and Computing. 2: 513-518. DOI: 10.1017/S0963548300000870 |
0.388 |
|
1993 |
Erdos P, Hajnal A, Simonovits M, Sós VT, Szemerédi E. Turán-Ramsey theorems and simple asymptotically extremal structures Combinatorica. 13: 31-56. DOI: 10.1007/Bf01202788 |
0.3 |
|
1992 |
Pach J, Steiger W, Szemerédi E. An upper bound on the number of planar K-sets Discrete &Amp; Computational Geometry. 7: 109-123. DOI: 10.1007/Bf02187829 |
0.396 |
|
1992 |
Chung FRK, Szemerédi E, Trotter WT. The number of different distances determined by a set of points in the Euclidean plane Discrete &Amp; Computational Geometry. 7: 1-11. DOI: 10.1007/Bf02187820 |
0.401 |
|
1990 |
Hajnal P, Szemerédi E. Brooks coloring in parallel Siam Journal On Discrete Mathematics. 3: 74-80. DOI: 10.1137/0403008 |
0.385 |
|
1990 |
Szemerédi E. Integer sets containing no arithmetic progressions Acta Mathematica Hungarica. 56: 155-158. DOI: 10.1007/Bf01903717 |
0.306 |
|
1989 |
Ajtai M, Karabeg D, Komlós J, Szemerédi E. Sorting in average time o (log n ) Siam Journal On Discrete Mathematics. 2: 285-292. DOI: 10.1137/0402024 |
0.375 |
|
1989 |
Cole R, Salowe JS, Steiger WL, Szemerédi E. An Optimal-Time Algorithm for Slope Selection Siam Journal On Computing. 18: 792-810. DOI: 10.1137/0218055 |
0.384 |
|
1989 |
Galil Z, Kannan R, Szemeredi E. On 3-pushdown graphs with large separators Combinatorica. 9: 9-19. DOI: 10.1007/Bf02122679 |
0.433 |
|
1988 |
Chvátal V, Szemerédi E. Many hard examples for resolution Journal of the Acm. 35: 759-768. DOI: 10.1145/48014.48016 |
0.384 |
|
1988 |
Ragde P, Steiger W, Szemerédi E, Wigderson A. The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ Siam Journal On Discrete Mathematics. 1: 399-410. DOI: 10.1137/0401040 |
0.437 |
|
1988 |
Pintz J, Steiger WL, Szemeredi E. On sets of natural numbers whose difference set contains no squares Journal of the London Mathematical Society. 219-231. DOI: 10.1112/Jlms/S2-37.2.219 |
0.359 |
|
1987 |
Babai L, Hajnal P, Szemerédi E, Turán G. A lower bound for read-once-only branching programs Journal of Computer and System Sciences. 35: 153-162. DOI: 10.1016/0022-0000(87)90010-9 |
0.409 |
|
1985 |
Gyárfás A, Prömel HJ, Voigt B, Szemerédi E. On the sum of the reciprocals of cycle lengths in sparse graphs Combinatorica. 5: 41-52. DOI: 10.1007/Bf02579441 |
0.396 |
|
1984 |
Fredman ML, Komlós J, Szemerédi E. Storing a Sparse Table with 0(1) Worst Case Access Time Journal of the Acm (Jacm). 31: 538-544. DOI: 10.1145/828.1884 |
0.351 |
|
1984 |
Kierstead HA, Szemerédi E, Trotter WT. On coloring graphs with locally small chromatic number Combinatorica. 4: 183-185. DOI: 10.1007/Bf02579219 |
0.46 |
|
1984 |
Gyárfás A, Komlós J, Szemerédi E. On the distribution of cycle lengths in graphs Journal of Graph Theory. 8: 441-462. DOI: 10.1002/Jgt.3190080402 |
0.359 |
|
1983 |
Chvátal V, Szemerédi E. Notes on the erdös-stone theorem North-Holland Mathematics Studies. 75: 183-190. DOI: 10.1016/S0304-0208(08)73386-3 |
0.458 |
|
1983 |
Szemerédi E, Trotter WT. A Combinatorial Distinction Between the Euclidean and Projective Planes European Journal of Combinatorics. 4: 385-394. DOI: 10.1016/S0195-6698(83)80036-5 |
0.393 |
|
1983 |
Chvátal V, Szemerédi E. Short cycles in directed graphs Journal of Combinatorial Theory, Series B. 35: 323-327. DOI: 10.1016/0095-8956(83)90059-X |
0.446 |
|
1983 |
Chvatál C, Rödl V, Szemerédi E, Trotter WT. The Ramsey number of a graph with bounded maximum degree Journal of Combinatorial Theory, Series B. 34: 239-243. DOI: 10.1016/0095-8956(83)90037-0 |
0.44 |
|
1983 |
Komlós J, Szemerédi E. Limit distribution for the existence of Hamiltonian cycles in a random graph Discrete Mathematics. 306: 1032-1038. DOI: 10.1016/0012-365X(83)90021-3 |
0.502 |
|
1983 |
Erdős P, Hajnal A, Sós VT, Szemerédi E. More results on Ramsey—Turán type problems Combinatorica. 3: 69-81. DOI: 10.1007/Bf02579342 |
0.499 |
|
1983 |
Ajtai M, Komlós J, Szemerédi E. Sorting in c log n parallel steps Combinatorica. 3: 1-19. DOI: 10.1007/Bf02579338 |
0.328 |
|
1983 |
Szemerédi E, Trotter WT. Extremal problems in discrete geometry Combinatorica. 3: 381-392. DOI: 10.1007/Bf02579194 |
0.398 |
|
1982 |
Erdös P, Hajnal A, Szemerédi E. On Almost Bipartite Large Chromatic Graphs North-Holland Mathematics Studies. 60: 117-123. DOI: 10.1016/S0304-0208(08)73497-2 |
0.438 |
|
1982 |
Ajtai M, Chvátal V, Newborn MM, Szemerédi E. Crossing-Free Subgraphs North-Holland Mathematics Studies. 60: 9-12. DOI: 10.1016/S0304-0208(08)73484-4 |
0.409 |
|
1982 |
Ajtai M, Komlós J, Pintz J, Spencer J, Szemerédi E. Extremal uncrowded hypergraphs Journal of Combinatorial Theory, Series A. 32: 321-335. DOI: 10.1016/0097-3165(82)90049-8 |
0.412 |
|
1982 |
Ajtai M, Komlós J, Szemerédi E. Largest random component of a k -cube Combinatorica. 2: 1-7. DOI: 10.1007/Bf02579276 |
0.35 |
|
1982 |
Szemerédi E, Tuza Z. Upper bound for transversals of tripartite hypergraphs Periodica Mathematica Hungarica. 13: 321-323. DOI: 10.1007/Bf01849243 |
0.312 |
|
1981 |
Chvátal V, Szemerédi E. On the ErdÖS-Stone Theorem Journal of the London Mathematical Society-Second Series. 207-214. DOI: 10.1112/Jlms/S2-23.2.207 |
0.308 |
|
1981 |
Ajtai M, Erdős P, Komlós J, Szemerédi E. On Turán’s theorem for sparse graphs Combinatorica. 1: 313-317. DOI: 10.1007/Bf02579451 |
0.427 |
|
1981 |
Ajtai M, Komlós J, Szemerédi E. The longest path in a random graph Combinatorica. 1: 1-12. DOI: 10.1007/Bf02579172 |
0.436 |
|
1980 |
Ajtai M, Komlós J, Szemerédi E. A note on Ramsey numbers Journal of Combinatorial Theory, Series A. 29: 354-360. DOI: 10.1016/0097-3165(80)90030-8 |
0.35 |
|
1980 |
Gyárfás A, Szemeredi E, Tuza Z. Induced subtrees in graphs of large chromatic number Discrete Mathematics. 30: 235-244. DOI: 10.1016/0012-365X(80)90230-7 |
0.395 |
|
1978 |
Bollobás B, Erdös P, Simonovits M, Szemerédi E. Extremal Graphs without Large Forbidden Subgraphs Annals of Discrete Mathematics. 3: 29-41. DOI: 10.1016/S0167-5060(08)70495-3 |
0.494 |
|
1978 |
Erdös P, Szemerédi E. Combinatorial properties of systems of sets Journal of Combinatorial Theory, Series A. 24: 308-313. DOI: 10.1016/0097-3165(78)90060-2 |
0.44 |
|
1978 |
Graham RL, Szemerédi E. On subgraph number independence in trees Journal of Combinatorial Theory, Series B. 24: 213-222. DOI: 10.1016/0095-8956(78)90022-9 |
0.465 |
|
1978 |
Guibas LJ, Szemeredi E. The analysis of double hashing Journal of Computer and System Sciences. 16: 226-274. DOI: 10.1016/0022-0000(78)90046-6 |
0.328 |
|
1976 |
Szemerédi E. On a problem of P. Erdös Journal of Number Theory. 8: 264-270. DOI: 10.1016/0022-314X(76)90003-2 |
0.393 |
|
1975 |
Szemerédi E. On sets of integers containing k elements in arithmetic progression Acta Arithmetica. 27: 199-245. DOI: 10.4064/Aa-27-1-199-245 |
0.304 |
|
1975 |
Choi SLG, Komlos J, Szemerédi E. On sum-free subsequences Transactions of the American Mathematical Society. 212: 307-313. DOI: 10.1090/S0002-9947-1975-0376594-1 |
0.464 |
|
1975 |
Erdös P, Graham R, Szemerédi E. On sparse graphs with dense long paths Computers & Mathematics With Applications. 1: 365-369. DOI: 10.1016/0898-1221(75)90037-1 |
0.493 |
|
1975 |
Bollobás B, Erdös P, Szemerédi E. On complete subgraphs of r-chromatic graphs Discrete Mathematics. 13: 97-107. DOI: 10.1016/0012-365X(75)90011-4 |
0.436 |
|
1972 |
Hajnal A, Milner EC, Szemerédi E. A cure for the telephone disease Canadian Mathematical Bulletin. 15: 447-450. DOI: 10.4153/Cmb-1972-081-0 |
0.417 |
|
1970 |
Szemerédi E. On a conjecture of Erdös and Heilbronn Acta Arithmetica. 17: 227-229. DOI: 10.4064/Aa-17-3-227-229 |
0.43 |
|
Show low-probability matches. |