Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Nagle, Brendan
Rödl, Vojtěch
and
Schacht, Mathias
2006.
Topics in Discrete Mathematics.
Vol. 26,
Issue. ,
p.
247.
Шкредов, Илья Дмитриевич
and
Shkredov, Il'ya Dmitrievich
2006.
Теорема Семереди и задачи об арифметических прогрессиях.
Успехи математических наук,
Vol. 61,
Issue. 6,
p.
111.
Tao, Terence
2007.
A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma.
Journal d'Analyse Mathématique,
Vol. 103,
Issue. 1,
p.
1.
Avart, Christian
Rödl, Vojtěch
and
Schacht, Mathias
2007.
Every Monotone 3‐Graph Property is Testable.
SIAM Journal on Discrete Mathematics,
Vol. 21,
Issue. 1,
p.
73.
Tao, Terence
2007.
Structure and Randomness in Combinatorics.
p.
3.
RÖDL, VOJTĚCH
and
SCHACHT, MATHIAS
2007.
Regular Partitions of Hypergraphs: Regularity Lemmas.
Combinatorics, Probability and Computing,
Vol. 16,
Issue. 6,
p.
833.
Tao, Terence
2007.
What is good mathematics?.
Bulletin of the American Mathematical Society,
Vol. 44,
Issue. 4,
p.
623.
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.
Austin, Tim
2008.
On exchangeable random variables and the statistics of large graphs and hypergraphs.
Probability Surveys,
Vol. 5,
Issue. none,
Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
and
Osthus, Deryk
2008.
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers.
Journal of Combinatorial Theory, Series B,
Vol. 98,
Issue. 3,
p.
484.
GOWERS, W. T.
2008.
Quasirandom Groups.
Combinatorics, Probability and Computing,
Vol. 17,
Issue. 3,
p.
363.
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.
Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
and
Osthus, Deryk
2009.
Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs.
Combinatorica,
Vol. 29,
Issue. 3,
p.
263.
Shapira, Asaf
2009.
Green's conjecture and testing linear-invariant properties.
p.
159.
Шкредов, Илья Дмитриевич
and
Shkredov, Il'ya Dmitrievich
2009.
О двумерном аналоге теоремы Семереди в абелевых группах.
Известия Российской академии наук. Серия математическая,
Vol. 73,
Issue. 5,
p.
181.
Keevash, Peter
2009.
A hypergraph regularity method for generalized Turán problems.
Random Structures & Algorithms,
Vol. 34,
Issue. 1,
p.
123.
Shkredov, Il'ya D
2009.
On a two-dimensional analogue of Szemerédi's theorem in Abelian groups.
Izvestiya: Mathematics,
Vol. 73,
Issue. 5,
p.
1033.
Langlois, Marina
Mubayi, Dhruv
Sloan, Robert H.
and
Turán, György
2009.
Graph Theory, Computational Intelligence and Thought.
Vol. 5420,
Issue. ,
p.
54.
Dotson, Ryan
and
Nagle, Brendan
2009.
Hereditary properties of hypergraphs.
Journal of Combinatorial Theory, Series B,
Vol. 99,
Issue. 2,
p.
460.
Shapira, Asaf
and
Yuster, Raphael
2010.
The effect of induced subgraphs on quasi‐randomness.
Random Structures & Algorithms,
Vol. 36,
Issue. 1,
p.
90.