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
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
On the number of Hamiltonian cycles in Dirac graphs
Sárközy, Gábor N., Selkow, Stanley M., Szemerédi, Endre
Published in Discrete mathematics (06.04.2003)
Published in Discrete mathematics (06.04.2003)
Get full text
Journal Article
Quadripartite version of the Hajnal–Szemerédi theorem
Get full text
Journal Article
Conference Proceeding
How to avoid using the Regularity Lemma: Pósa’s conjecture revisited
Get full text
Journal Article
Conference Proceeding
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
Short paths in quasi-random triple systems with sparse underlying graphs
Polcyn, Joanna, Rödl, Vojtech, Ruciński, Andrzej, Szemerédi, Endre
Published in Journal of combinatorial theory. Series B (01.07.2006)
Published in Journal of combinatorial theory. Series B (01.07.2006)
Get full text
Journal Article
A Dense Infinite Sidon Sequence
Ajtai, Miklós, Komlós, János, Szemerédi, Endre
Published in European journal of combinatorics (01.03.1981)
Published in European journal of combinatorics (01.03.1981)
Get full text
Journal Article
A note on Ramsey numbers
Ajtai, Miklós, Komlós, János, Szemerédi, Endre
Published in Journal of combinatorial theory. Series A (01.01.1980)
Published in Journal of combinatorial theory. Series A (01.01.1980)
Get full text
Journal Article
Optimal parallel selection has complexity O(Log Log N)
Ajtai, Miklós, Komlós, János, Steiger, W.L., Szemerédi, Endre
Published in Journal of computer and system sciences (01.02.1989)
Published in Journal of computer and system sciences (01.02.1989)
Get full text
Journal Article
A lower bound for read-once-only branching programs
Babai, László, Hajnal, Péter, Szemerédi, Endre, Turán, György
Published in Journal of computer and system sciences (01.10.1987)
Published in Journal of computer and system sciences (01.10.1987)
Get full text
Journal Article