Endre Szemerédi

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	On Distinct Consecutive Differences	2021	Imre Z. Ruzsa George Shakan József Solymosi Endre Szemerédi
+ PDF Chat	Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs	2019	Christian Reiher Vojtěch Rödl Andrzej Ruciński Mathias Schacht Endre Szemerédi
+ PDF Chat	Embedding Graphs into Larger Graphs: Results, Methods, and Problems	2019	Miklós Simonovits Endre Szemerédi
+	Embedding graphs into larger graphs: results, methods, and problems	2019	Miklós Simonovits Endre Szemerédi
+	On distinct consecutive differences	2019	Imre Z. Ruzsa George Shakan József Solymosi Endre Szemerédi
+	Additive combinatorics and graph theory	2018	Endre Szemerédi
+	Two Geometrical Applications of the Semi-random Method	2018	Peter I. Hajnal Endre Szemerédi
+ PDF Chat	On the Hamiltonicity of Triple Systems with High Minimum Degree	2017	Vojtěch Rödl Andrzej Ruciński Mathias Schacht Endre Szemerédi
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+	Structural Approach to Subset Sum Problems	2016	Endre Szemerédi
+	Erdős’s Unit Distance Problem	2016	Endre Szemerédi
+	Arithmetic Progressions, Different Regularity Lemmas and Removal Lemmas	2015	Endre Szemerédi
+ PDF	The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs	2015	Endre Szemerédi Maya Stein Miklós Simonovits Diana Piguet Jan Hladký
+	Maximum size of a set of integers with no two adding up to a square	2015	Endre Szemerédi
+	Near-optimum universal graphs for graphs with bounded degrees (Extended abstract)	2015	Noga Alon Michael Capalbo Yoshiharu Kohayakawa Vojtěch Rödl Andrzej Ruciński Endre Szemerédi
+	Is laziness paying off? (“Absorbing” method)	2013	Endre Szemerédi
+	Various Regularity Lemmas in Graphs and Hypergraphs	2013	Endre Szemerédi
+	The approximate Loebl-Komlós-Sós Conjecture	2012	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+	A Practical Regularity Partitioning Algorithm and its Applications in Clustering	2012	Gábor N. Sárközy Fei Song Endre Szemerédi Shubhendu Trivedi
+	The approximate Loebl-Komlós-Sós Conjecture	2012	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+	Extremális és véletlen struktúrák = Extremal and random structures	2012	Miklós Simonovits Gábor Elek Zoltán Füredi Ervin Győri Balázs Patkós Endre Szemerédi Vera T. Sós
+	A Practical Regularity Partitioning Algorithm and its Applications in Clustering	2012	Gábor N. Sárközy Fei Song Endre Szemerédi Shubhendu Trivedi
+	Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs	2011	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi
+ PDF	Partitioning $3$-Colored Complete Graphs into Three Monochromatic Cycles	2011	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi
+	Sparse partition universal graphs for graphs of bounded degree	2011	Yoshiharu Kohayakawa Vojtěch Rödl Mathias Schacht Endre Szemerédi
+	Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs	2010	András Gyárfás Gábor N. Sárközy Endre Szemerédi
+ PDF	A fast algorithm for equitable coloring	2010	Henry A. Kiersteád Alexandr Kostochka Marcelo Mydlarz Endre Szemerédi
+	Tight Bounds for Embedding Bounded Degree Trees	2010	Béla Csaba Judit Nagy-György Ian Levitt Endre Szemerédi
+ PDF	Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs	2010	András Gyárfás Gábor N. Sárközy Endre Szemerédi
+	Embedding spanning subgraphs into large dense graphs	2010	Endre Szemerédi Asif Jamshed
+	How to avoid using the Regularity Lemma: Pósa’s conjecture revisited	2009	Ian Levitt Gábor N. Sárközy Endre Szemerédi
+ PDF	Monochromatic Hamiltonian 3‐tight Berge cycles in 2‐colored 4‐uniform hypergraphs	2009	András Gyárfás Gábor N. Sárközy Endre Szemerédi
+ PDF	Stability of the path–path Ramsey number	2009	András Gyárfás Gábor N. Sárközy Endre Szemerédi
+	Diszkrét matematika = Discrete mathematics	2009	Gyula Y. Katona András Ádám Imre Bárány Gábor Elek Péter L. Erdős Zoltán Füredi Dániel Gerbner Ervin Győri Dezső Miklós László Pyber
+	Perfect matchings in large uniform hypergraphs with large minimum collective degree	2008	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi
+ PDF	The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs	2008	András Gyárfás Gábor N. Sárközy Endre Szemerédi
+ PDF	Three-color Ramsey numbers for paths	2008	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi
+	An approximate Dirac-type theorem for k-uniform hypergraphs	2008	Vojtěch Rödl Endre Szemerédi Andrzej Ruciński
+	Számelmélet és kombinatorikus vonatkozásai = Number Theory and its Interactions with Combinatorics	2008	Vera T. Sós András Bíró György Elekes Imre Z. Ruzsa Endre Szemerédi
+ PDF	Subset sums modulo a prime	2008	Hoi H. Nguyen Endre Szemerédi Van H. Vu
+	A note on perfect matchings in uniform hypergraphs with large minimum collective degree	2008	Vojtěch Rödl Andrzej Ruciński Mathias Schacht Endre Szemerédi
+	An old new proof of Roth’s theorem	2007	Endre Szemerédi
+	Quadripartite version of the Hajnal–Szemerédi theorem	2007	Ryan R. Martin Endre Szemerédi
+	One-sided Coverings of Colored Complete Bipartite Graphs	2007	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi
+ PDF	Tripartite Ramsey numbers for paths	2007	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi
+	Three-Color Ramsey Numbers For Paths	2007	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi
+	Perfect matchings in uniform hypergraphs with large minimum degree	2006	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi
+	Limit distribution for the existence of Hamiltonian cycles in a random graph	2006	János Komlós Endre Szemerédi
+	An improved bound for the monochromatic cycle partition number	2006	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi
+	Short paths in quasi-random triple systems with sparse underlying graphs	2006	Joanna Polcyn Vojtěch Rödl Andrzej Ruciński Endre Szemerédi
+	On the Number of Monochromatic Solutions of x + y =z 2	2006	AYMAN KHALFALAH Endre Szemerédi
+ PDF	Finite and infinite arithmetic progressions in sumsets	2006	Endre Szemerédi Van H. Vu
+	A Dirac-Type Theorem for 3-Uniform Hypergraphs	2006	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi
+	Subset sums in $\BZ_p$	2006	Hoi H. Nguyen Endre Szemerédi Van H. Vu
+	Long arithmetic progressions in sumsets: Thresholds and bounds	2005	Endre Szemerédi Van Vu
+	On a question of Erdős and Moser	2005	Benny Sudakov Endre Szemerédi Van H. Vu
+	Long arithmetic progressions in sum-sets and the number x-sum-free sets	2005	Endre Szemerédi Van H. Vu
+ PDF	The Generalization of Dirac’s Theorem for Hypergraphs	2005	Endre Szemerédi Andrzej Ruciński Vojtěch Rödl
+	Long arithmetic progressions in sumsets: Thresholds and Bounds	2005	Endre Szemerédi Van Vu
+ PDF	On the number of Hamiltonian cycles in Dirac graphs	2003	Gábor N. Sárközy Stanley M. Selkow Endre Szemerédi
+	Universality and tolerance	2002	Noga Alon Michael Capalbo Yoshiharu Kohayakawa V. Rödl Andrzej Ruciński Endre Szemerédi
+	Tight bound for the density of sequence of integers the sum of no two of which is a perfect square	2002	AYMAN KHALFALAH Sachin Lodha Endre Szemerédi
+ PDF	Girth of sparse graphs	2002	Béla Bollobás Endre Szemerédi
+	The Regularity Lemma and Its Applications in Graph Theory	2002	János Komlós Ali Shokoufandeh Miklós Simonovits Endre Szemerédi
+ PDF	Spanning Trees in Dense Graphs	2001	János Komlós Gábor N. Sárközy Endre Szemerédi
+ PDF	Proof of the Alon–Yuster conjecture	2001	János Komlós Gábor N. Sárközy Endre Szemerédi
+ PDF	Near-optimum Universal Graphs for Graphs with Bounded Degrees	2001	Noga Alon Michael Capalbo Yoshiharu Kohayakawa Vojtěch Rödl Andrzej Ruciński Endre Szemerédi
+	On the running time of the Adleman--Pomerance--Rumely primality test	2000	J. Pelikán J. Pintz Endre Szemerédi
+	On Size Ramsey Numbers of Graphs with Bounded Degree	2000	Vojtěch Rödl Endre Szemerédi
+	Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles	1998	Tomasz Łuczak Vojtěch Rödl Endre Szemerédi
+	On the Pósa-Seymour conjecture	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+ PDF Chat	An algorithmic version of the blow‐up lemma	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+ PDF	Proof of the Seymour conjecture for large graphs	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Spanning subgraphs of dense graphs and a combinatorial problem on strings	1998	Sarmad Abbasi Endre Szemerédi
+	Turán–Ramsey Theorems and <i>K<sub>p</sub></i>-Independence Numbers	1997	Paul Erdös A. Hajnal Miklós Simonovits Vera T. Sós Endre Szemerédi
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Topological cliques in graphs II	1996	János Komlós Endre Szemerédi
+	Matching nuts and bolts in O(n log n) time	1996	János Komlós Yuan Ma Endre Szemerédi
+	An Algorithmic Version of the Blow-up Lemma	1996	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Proof of a Packing Conjecture of Bollobás	1995	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Lower bounds for sorting networks	1995	Nabil Kahalé Tom Leighton Yuan Ma C. Greg Plaxton Torsten Suel Endre Szemerédi
+	Dense Graphs without 3-Regular Subgraphs	1995	László Pyber Vojtěch Rödl Endre Szemerédi
+ PDF	On the probability that a random ±1-matrix is singular	1995	Jeff Kahn János Komlós Endre Szemerédi
+	On a problem in additive number theory	1994	Andràs Sárközy Endre Szemerédi
+	Turán-Ramsey Theorems and <i>K<sub>p</sub></i>-Independence Numbers	1994	Paul Erdös A. Hajnal Miklós Simonovits Vera T. Sós Endre Szemerédi
+	Difference sets without κ-th powers	1994	Antal Balog J. Pelikán J. Pintz Endre Szemerédi
+	Topological Cliques in Graphs	1994	János Komlós Endre Szemerédi
+	Constructing Small Sets that are Uniform in Arithmetic Progressions	1993	Alexander Razborov Endre Szemerédi Avi Wigderson
+ PDF	Turán-Ramsey theorems and simple asymptotically extremal structures	1993	Paul Erdös A. Hajnal Miklós Simonovits Vera T. Sós Endre Szemerédi
+ PDF	The number of different distances determined by a set of points in the Euclidean plane	1992	Fan Chung Endre Szemerédi W. T. Trotter
+	Construction of a Thin Set with small Fourier Coefficients	1990	Miklós Ajtai Henryk Iwaniec János Komlós J. Pintz Endre Szemerédi
+	Integer sets containing no arithmetic progressions	1990	Endre Szemerédi
+ PDF	Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes	1989	J. Pintz William Steiger Endre Szemerédi
+	There are no p-complete families of symmetric boolean functions	1989	Mihály Geréb-Graus Ramamohan Paturi Endre Szemerédi
+	On the second eigenvalue of random regular graphs	1989	Joel Friedman J. Kahn Endre Szemerédi
+ PDF	Infinite sets of primes with fast primality tests and quick generation of large primes	1989	J. Pintz William Steiger Endre Szemerédi
+	On Sets of Natural Numbers Whose Difference Set Contains No Squares	1988	J. Pintz William Steiger Endre Szemerédi
+	Two infinite sets of primes with fast primality tests	1988	J. Pintz William Steiger Endre Szemerédi
+	On the sum of the reciprocals of cycle lengths in sparse graphs	1985	András Gyárfás Hans Jürgen Prömel Bernd Voigt Endre Szemerédi
+	First Occurrence of Hamilton Cycles in Random Graphs	1985	Miklós Ajtai János Komlós Endre Szemerédi
+	On the distribution of cycle lengths in graphs	1984	András Gyárfás János Komlós Endre Szemerédi
+	On coloring graphs with locally small chromatic number	1984	H. A. Kierstead Endre Szemerédi W. T. Trotter
+	Unit distances in the Euclidean plane	1984	Joel Spencer Endre Szemerédi WT Trotter
+	On The Complexity Of Matrix Group Problems I	1984	László Babai Endre Szemerédi
+	Short cycles in directed graphs	1983	Vašek Chvátal Endre Szemerédi
+	Extremal problems in discrete geometry	1983	Endre Szemerédi W. T. Trotter
+	The Ramsey number of a graph with bounded maximum degree	1983	C Chvatál V. Rödl Endre Szemerédi W. T. Trotter
+ PDF	More results on Ramsey—Turán type problems	1983	Paul Erdös A. Hajnal Vera T. Sós Endre Szemerédi
+	Notes on the Erdös-Stone Theorem	1983	Vašek Chvátal Endre Szemerédi
+ PDF	On sums and products of integers	1983	Péter L. Erdős Endre Szemerédi
+	Limit distribution for the existence of hamiltonian cycles in a random graph	1983	János Komlós Endre Szemerédi
+	Upper bound for transversals of tripartite hypergraphs	1982	Endre Szemerédi Zs. Tuza
+	On an Extremal Problem Concerning Intervals	1982	Vašek Chvátal Endre Szemerédi
+	Extremal uncrowded hypergraphs	1982	Miklós Ajtai János Komlós J. Pintz Joel Spencer Endre Szemerédi
+	Largest random component of ak-cube	1982	Miklós Ajtai János Komlós Endre Szemerédi
+	A Lower Bound for Heilbronn'S Problem	1982	János Komlós J. Pintz Endre Szemerédi
+ PDF	On Almost Bipartite Large Chromatic Graphs	1982	P. Erdős A. Hajnal Endre Szemerédi
+	On coverings of random graphs	1982	Miklós Ajtai János Komlós Vojtěch Rödl Endre Szemerédi
+	On Heilbronn's Triangle Problem	1981	János Komlós J. Pintz Endre Szemerédi
+ PDF	On Turán’s theorem for sparse graphs	1981	Miklós Ajtai Paul Erdös János Komlós Endre Szemerédi
+	On the Erdös-Stone Theorem	1981	Vašek Chvátal Endre Szemerédi
+	The longest path in a random graph	1981	Miklós Ajtai János Komlós Endre Szemerédi
+	A Dense Infinite Sidon Sequence	1981	Miklós Ajtai János Komlós Endre Szemerédi
+	A note on Ramsey numbers	1980	Miklós Ajtai János Komlós Endre Szemerédi
+	Induced subtrees in graphs of large chromatic number	1980	András Gyárfás Endre Szemerédi Zs. Tuza
+	Topological complete subgraphs in random graphs	1979	Miklós Ajtai János Komlós Endre Szemerédi
+	Combinatorial properties of systems of sets	1978	P. Erdős Endre Szemerédi
+	On subgraph number independence in trees	1978	Ronald L. Graham Endre Szemerédi
+ PDF	Extremal Graphs without Large Forbidden Subgraphs	1978	B Bollobás P. Erdős Miklós Simonovits Endre Szemerédi
+	On a problem of P. Erdös	1976	Endre Szemerédi
+	REGULAR PARTITIONS OF GRAPHS	1975	Endre Szemerédi
+	Linear problems in combinatorial number theory	1975	János Komlós M. Sulyok Endre Szemerédi
+ PDF	On sets of integers containing k elements in arithmetic progression	1975	Endre Szemerédi
+	On sparse graphs with dense long paths	1975	P. Erdős Ronald Graham Endre Szemerédi
+	On complete subgraphs of r-chromatic graphs	1975	B Bollobás Paul Erdös Endre Szemerédi
+ PDF	On a problem of Davenport and Schinzel	1974	Endre Szemerédi
+	On a problem of P. Erdős	1973	Endre Szemerédi
+ PDF	On the difference of consecutive terms of sequences defined by divisibility properties, II	1973	Endre Szemerédi
+ PDF	On a conjecture of Erdös and Heilbronn	1970	Endre Szemerédi
+	On sets of integers containing no four elements in arithmetic progression	1969	Endre Szemerédi
+	Über Folgen Ganzer Zahlen	1969	Péter L. Erdős A. Sárközi Endre Szemerédi
+ PDF	On the divisibility properties of sequences of integers (II)	1968	Paul Erdös Andràs Sárközy Endre Szemerédi
+	On the Solvability of Certain Equations in Sequences of Positive Upper Logarithmic Density	1968	P. Erdős A. Sárközi Endre Szemerédi
+ PDF	On a problem of P. Erdos and S. Stein	1968	P. Erdős Endre Szemerédi
+ PDF	On a theorem of Behrend	1967	Péter L. Erdős Andràs Sárközy Endre Szemerédi
+ PDF	On An Extremal Problem Concerning Primitive Sequences	1967	Péter L. Erdős A. Sárközi Endre Szemerédi
+	On the solvability of the equations [ai, aj] = ar and (a′i, a′j) = a′r in sequences of positive density	1966	Péter L. Erdős Andràs Sárközy Endre Szemerédi
+ PDF	On the divisibility properties of integers (I)	1966	Paul Erdös Andràs Sárközy Endre Szemerédi

Common Coauthors

Coauthor	Papers Together
János Komlós	35
Gábor N. Sárközy	23
Vojtěch Rödl	16
Miklós Simonovits	16
András Gyárfás	14
Andrzej Ruciński	13
J. Pintz	10
Miklós Ajtai	10
Paul Erdös	8
Vera T. Sós	7
Maya Stein	7
Jan Hladký	7
Péter L. Erdős	6
P. Erdős	6
Miklós Ruszinkó	6
Andràs Sárközy	5
A. Hajnal	5
Van H. Vu	4
Vašek Chvátal	4
Yoshiharu Kohayakawa	4
W. T. Trotter	4
Mathias Schacht	4
Diana Piguet	4
William Steiger	4
Diana Piguet	3
V. Rödl	3
Van Vu	3
Michael Capalbo	3
Imre Z. Ruzsa	3
Noga Alon	3
A. Sárközi	3
József Solymosi	2
Zs. Tuza	2
B Bollobás	2
Ervin Győri	2
Ian Levitt	2
J. Pelikán	2
Hoi H. Nguyen	2
Yuan Ma	2
Zoltán Füredi	2
George Shakan	2
Gábor Elek	2
AYMAN KHALFALAH	2
Shubhendu Trivedi	2
Henryk Iwaniec	1
Joanna Polcyn	1
Imre Bárány	1
Mihály Geréb-Graus	1
Gábor Tardos	1
C Chvatál	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	REGULAR PARTITIONS OF GRAPHS	1975	Endre Szemerédi	33
+	Extremal Graph Theory	1978	Béla Bollobás	19
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi	17
+	A Dirac-Type Theorem for 3-Uniform Hypergraphs	2006	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi	14
+ PDF	The Algorithmic Aspects of the Regularity Lemma	1994	Noga Alon Richard A. Duke Hanno Lefmann V. Rödl Raphael Yuster	11
+ PDF	On the structure of linear graphs	1946	Paul Erdös A. H. Stone	11
+ PDF	On sets of integers containing k elements in arithmetic progression	1975	Endre Szemerédi	11
+	An algorithmic version of the blow-up lemma	1998	János Komlós Gábor N. Sárközy Endre Szemerédi	10
+	On the square of a Hamiltonian cycle in dense graphs	1996	J�nos Koml�s G�bor N. S�rk�zy Endre Szemer�di	10
+	Hamiltonian chains in hypergraphs	1999	Gyula Y. Katona H. A. Kierstead	10
+	Proof of a Packing Conjecture of Bollobás	1995	János Komlós Gábor N. Sárközy Endre Szemerédi	10
+	Szemeredi''s Regularity Lemma and its applications in graph theory	1995	János Komlós Miklós Simonovits	10
+ PDF	Three-color Ramsey numbers for paths	2008	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi	9
+	Hamiltonian chains in hypergraphs	1999	Gyula Y. Katona H. A. Kierstead	9
+ PDF	On the Structure of Edge Graphs II	1976	B Bollobás P. Erdős Miklós Simonovits	9
+	Hamiltonian circuits in random graphs	1976	L. Pósa	7
+	Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree	2006	Daniela Kühn Deryk Osthus	7
+	Expanding graphs contain all small trees	1987	Joel Friedman Nicholas Pippenger	7
+	R(Cn,Cn,Cn)⩽(4+o(1))n	1999	Tomasz Łuczak	7
+	Three-Color Ramsey Numbers For Paths	2007	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi	7
+	On Certain Sets of Integers	1953	K. F. Roth	7
+	The Ramsey number for hypergraph cycles I	2005	Penny Haxell Tomasz Łuczak Yuejian Peng V. Rödl Andrzej Ruciński Miklós Simonovits Jozef Skokan	7
+ PDF	Proof of the $(n/2-n/2-n/2)$ Conjecture for Large $n$	2011	Yi Zhao	7
+ PDF	Proof of the Seymour conjecture for large graphs	1998	János Komlós Gábor N. Sárközy Endre Szemerédi	7
+ PDF	Spanning Trees in Dense Graphs	2001	János Komlós Gábor N. Sárközy Endre Szemerédi	7
+ PDF	Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs	2007	András Gyárfás Jenő Lehel Gábor N. Sárközy R. H. Schelp	6
+	Perfect Matchings in ϵ-Regular Graphs and the Blow-Up Lemma	1999	Vojtěch Rödl Andrzej Ruciński	6
+	Regularity lemmas for hypergraphs and quasi‐randomness	1991	Fan Chung	6
+	On the Pósa-Seymour conjecture	1998	János Komlós Gábor N. Sárközy Endre Szemerédi	6
+ PDF	On a Ramsey-Turán type problem	1976	Béla Bollobás P. Erdős	6
+	Extremal problems on set systems	2002	Péter Frankl Vojtěch Rödl	6
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi	6
+	The Square of Paths and Cycles	1995	Genghua Fan H. A. Kierstead	6
+	The Square of a Hamiltonian Cycle	1994	Genghua Fan Roland Häggkvist	6
+ PDF	Universal Graphs for Bounded-Degree Trees and Planar Graphs	1989	Sandeep Bhatt Fan Chung Frank Thomson Leighton Arnold L. Rosenberg	6
+	The Ramsey number for a triple of long even cycles	2006	Agnieszka Figaj Tomasz Łuczak	6
+ PDF Chat	An approximate version of the Loebl–Komlós–Sós conjecture	2011	Diana Piguet Maya Stein	6
+	On the Structure of Edge Graphs	1973	Béla Bollobás Paul Erdös	6
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi	6
+ PDF	Can a Graph Have Distinct Regular Partitions?	2009	Noga Alon A. Shapira Uri Stav	5
+	Vertex coverings by monochromatic cycles and trees	1991	Péter L. Erdős András Gyárfás L. Pyber	5
+	Tight Bounds for Embedding Bounded Degree Trees	2010	Béla Csaba Judit Nagy-György Ian Levitt Endre Szemerédi	5
+	Finite addition theorems, I	1989	Andràs Sárközy	5
+	H-Factors in Dense Graphs	1996	Noga Alon Raphael Yuster	5
+ PDF Chat	Moments of Two-Variable Functions and the Uniqueness of Graph Limits	2010	Christian Borgs Jennifer Chayes László Lovász	5
+	Integer Sets Containing No Arithmetic Progressions	1987	D. R. Heath‐Brown	5
+	Loebl–Komlós–Sós Conjecture: Dense case	2015	Jan Hladký Diana Piguet	5
+ PDF Chat	Embedding large subgraphs into dense graphs	2009	Daniela Kühn Deryk Osthus	5
+	Szemerédi’s Regularity Lemma for Sparse Graphs	1997	Yoshiharu Kohayakawa	5
+	On maximal paths and circuits of graphs	1959	P. Erdős Т. Галлаи	5