Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs
Rödl, Vojtech, Ruciński, Andrzej, Szemerédi, Endre
Published in Advances in mathematics (New York. 1965) (20.06.2011)
Published in Advances in mathematics (New York. 1965) (20.06.2011)
Get full text
Journal Article
Perfect matchings in large uniform hypergraphs with large minimum collective degree
Rödl, Vojtech, Ruciński, Andrzej, Szemerédi, Endre
Published in Journal of combinatorial theory. Series A (01.04.2009)
Published in Journal of combinatorial theory. Series A (01.04.2009)
Get full text
Journal Article
An approximate Dirac-type theorem for k-uniform hypergraphs
Rödl, Vojtěch, Szemerédi, Endre, Ruciński, Andrzej
Published in Combinatorica (Budapest. 1981) (01.03.2008)
Published in Combinatorica (Budapest. 1981) (01.03.2008)
Get full text
Journal Article
Sparse partition universal graphs for graphs of bounded degree
Kohayakawa, Yoshiharu, Rödl, Vojtěch, Schacht, Mathias, Szemerédi, Endre
Published in Advances in mathematics (New York. 1965) (01.04.2011)
Published in Advances in mathematics (New York. 1965) (01.04.2011)
Get full text
Journal Article
A fast algorithm for equitable coloring
Kierstead, Henry A., Kostochka, Alexandr V., Mydlarz, Marcelo, Szemerédi, Endre
Published in Combinatorica (Budapest. 1981) (01.01.2010)
Published in Combinatorica (Budapest. 1981) (01.01.2010)
Get full text
Journal Article
Quadripartite version of the Hajnal–Szemerédi theorem
Get full text
Journal Article
Conference Proceeding
On the Hamiltonicity of Triple Systems with High Minimum Degree
Rödl, Vojtěch, Ruciński, Andrzej, Schacht, Mathias, Szemerédi, Endre
Published in Annals of combinatorics (01.03.2017)
Published in Annals of combinatorics (01.03.2017)
Get full text
Journal Article
How to avoid using the Regularity Lemma: Pósa’s conjecture revisited
Get full text
Journal Article
Conference Proceeding
Three-Color Ramsey Numbers For Paths
Gyárfás, András, Ruszinkó, Miklós, Sárközy†, Gábor N., Szemerédi, Endre
Published in Combinatorica (Budapest. 1981) (01.02.2007)
Published in Combinatorica (Budapest. 1981) (01.02.2007)
Get full text
Journal Article
Perfect matchings in uniform hypergraphs with large minimum degree
Rödl, Vojtech, Ruciński, Andrzej, Szemerédi, Endre
Published in European journal of combinatorics (01.11.2006)
Published in European journal of combinatorics (01.11.2006)
Get full text
Journal Article
An improved bound for the monochromatic cycle partition number
Gyárfás, András, Ruszinkó, Miklós, Sárközy, Gábor N., Szemerédi, Endre
Published in Journal of combinatorial theory. Series B (01.11.2006)
Published in Journal of combinatorial theory. Series B (01.11.2006)
Get full text
Journal Article
Partitioning $3$-Colored Complete Graphs into Three Monochromatic Cycles
Gyárfás, András, Ruszinkó, Miklós, Sárközy, Gábor N., Szemerédi, Endre
Published in The Electronic journal of combinatorics (11.03.2011)
Published in The Electronic journal of combinatorics (11.03.2011)
Get full text
Journal Article
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs
Gyárfás, András, Sárközy, Gábor N., Szemerédi, Endre
Published in The Electronic journal of combinatorics (13.10.2008)
Published in The Electronic journal of combinatorics (13.10.2008)
Get full text
Journal Article
Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs
Gyárfás, András, Sárközy, Gábor N., Szemerédi, Endre
Published in Annals of combinatorics (01.06.2010)
Published in Annals of combinatorics (01.06.2010)
Get full text
Journal Article
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs
Gyárfás, András, Sárközy, Gábor N., Szemerédi, Endre
Published in Graphs and combinatorics (01.01.2010)
Published in Graphs and combinatorics (01.01.2010)
Get full text
Journal Article
Three-color Ramsey numbers for paths
Gyárfás, András, Ruszinkó, Miklós, Sárközy, Gábor N., Szemerédi, Endre
Published in Combinatorica (Budapest. 1981) (01.01.2008)
Published in Combinatorica (Budapest. 1981) (01.01.2008)
Get full text
Journal Article