Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Szemerédi, Endre
Ruciński, Andrzej
and
Rödl, Vojtěch
2005.
Mathematical Foundations of Computer Science 2005.
Vol. 3618,
Issue. ,
p.
52.
Nagle, Brendan
Rödl, Vojtěch
and
Schacht, Mathias
2006.
Topics in Discrete Mathematics.
Vol. 26,
Issue. ,
p.
247.
Kühn, Daniela
and
Osthus, Deryk
2006.
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree.
Journal of Combinatorial Theory, Series B,
Vol. 96,
Issue. 6,
p.
767.
Rödl, Vojtech
Ruciński, Andrzej
and
Szemerédi, Endre
2006.
Perfect matchings in uniform hypergraphs with large minimum degree.
European Journal of Combinatorics,
Vol. 27,
Issue. 8,
p.
1333.
Polcyn, Joanna
Rödl, Vojtech
Ruciński, Andrzej
and
Szemerédi, Endre
2006.
Short paths in quasi-random triple systems with sparse underlying graphs.
Journal of Combinatorial Theory, Series B,
Vol. 96,
Issue. 4,
p.
584.
Kühn, Daniela
and
Osthus, Deryk
2006.
Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 20,
Issue. 2,
p.
273.
Mubayi, Dhruv
and
Zhao, Yi
2007.
Co-degree density of hypergraphs.
Journal of Combinatorial Theory, Series A,
Vol. 114,
Issue. 6,
p.
1118.
Rödl, Vojtěch
Szemerédi, Endre
and
Ruciński, Andrzej
2008.
An approximate Dirac-type theorem for k-uniform hypergraphs.
Combinatorica,
Vol. 28,
Issue. 2,
p.
229.
Dorbec, Paul
Gravier, Sylvain
and
Sárközy, Gábor N.
2008.
Monochromatic Hamiltonian t‐tight Berge‐cycles in hypergraphs.
Journal of Graph Theory,
Vol. 59,
Issue. 1,
p.
34.
Nagle, Brendan
Rödl, Vojtěch
and
Schacht, Mathias
2008.
Note on the 3-graph counting lemma.
Discrete Mathematics,
Vol. 308,
Issue. 19,
p.
4501.
Haxell, P. E.
Nagle, B.
and
Rödl, V.
2008.
An Algorithmic Version of the Hypergraph Regularity Method.
SIAM Journal on Computing,
Vol. 37,
Issue. 6,
p.
1728.
Hàn, Hip
Person, Yury
and
Schacht, Mathias
2009.
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree.
SIAM Journal on Discrete Mathematics,
Vol. 23,
Issue. 2,
p.
732.
Rödl, Vojtech
Ruciński, Andrzej
and
Szemerédi, Endre
2009.
Perfect matchings in large uniform hypergraphs with large minimum collective degree.
Journal of Combinatorial Theory, Series A,
Vol. 116,
Issue. 3,
p.
613.
Szymańska, Edyta
2009.
Combinatorial Algorithms.
Vol. 5874,
Issue. ,
p.
438.
Keevash, Peter
2009.
A hypergraph regularity method for generalized Turán problems.
Random Structures & Algorithms,
Vol. 34,
Issue. 1,
p.
123.
HAXELL, P. E.
ŁUCZAK, T.
PENG, Y.
RÖDL, V.
RUCIŃSKI, A.
and
SKOKAN, J.
2009.
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Combinatorics, Probability and Computing,
Vol. 18,
Issue. 1-2,
p.
165.
Rödl, Vojtech
and
RuciŃski, Andrzej
2010.
An Irregular Mind.
Vol. 21,
Issue. ,
p.
561.
Gyárfás, András
Sárközy, Gábor N.
and
Szemerédi, Endre
2010.
Monochromatic Hamiltonian 3‐tight Berge cycles in 2‐colored 4‐uniform hypergraphs.
Journal of Graph Theory,
Vol. 63,
Issue. 4,
p.
288.
Kühn, Daniela
Mycroft, Richard
and
Osthus, Deryk
2010.
Hamilton ℓ-cycles in uniform hypergraphs.
Journal of Combinatorial Theory, Series A,
Vol. 117,
Issue. 7,
p.
910.
Hàn, Hiệp
and
Schacht, Mathias
2010.
Dirac-type results for loose Hamilton cycles in uniform hypergraphs.
Journal of Combinatorial Theory, Series B,
Vol. 100,
Issue. 3,
p.
332.