Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Keevash, Peter
2005.
The Turán problem for projective geometries.
Journal of Combinatorial Theory, Series A,
Vol. 111,
Issue. 2,
p.
289.
Mubayi, Dhruv
2005.
The co-degree density of the Fano plane.
Journal of Combinatorial Theory, Series B,
Vol. 95,
Issue. 2,
p.
333.
Anstee, R.P.
and
Keevash, Peter
2006.
Pairwise intersections and forbidden configurations.
European Journal of Combinatorics,
Vol. 27,
Issue. 8,
p.
1235.
Mubayi, Dhruv
2006.
A hypergraph extension of Turán's theorem.
Journal of Combinatorial Theory, Series B,
Vol. 96,
Issue. 1,
p.
122.
Keevash, Peter
and
Zhao, Yi
2007.
Codegree problems for projective geometries.
Journal of Combinatorial Theory, Series B,
Vol. 97,
Issue. 6,
p.
919.
Mubayi, Dhruv
and
Pikhurko, Oleg
2007.
A new generalization of Mantel's theorem to k-graphs.
Journal of Combinatorial Theory, Series B,
Vol. 97,
Issue. 4,
p.
669.
Mubayi, Dhruv
2007.
An intersection theorem for four sets.
Advances in Mathematics,
Vol. 215,
Issue. 2,
p.
601.
Pikhurko, Oleg
2008.
An exact Turán result for the generalized triangle.
Combinatorica,
Vol. 28,
Issue. 2,
p.
187.
Mubayi, Dhruv
and
Pikhurko, Oleg
2008.
Constructions of non-principal families in extremal hypergraph theory.
Discrete Mathematics,
Vol. 308,
Issue. 19,
p.
4430.
Person, Yury
and
Schacht, Mathias
2009.
An expected polynomial time algorithm for coloring 2-colorable 3-graphs.
Electronic Notes in Discrete Mathematics,
Vol. 34,
Issue. ,
p.
465.
MUBAYI, DHRUV
and
RAMADURAI, RESHMA
2009.
Simplex Stability.
Combinatorics, Probability and Computing,
Vol. 18,
Issue. 3,
p.
441.
Mubayi, Dhruv
and
Verstraëte, Jacques
2009.
Two-regular subgraphs of hypergraphs.
Journal of Combinatorial Theory, Series B,
Vol. 99,
Issue. 3,
p.
643.
Keevash, Peter
2009.
A hypergraph regularity method for generalized Turán problems.
Random Structures & Algorithms,
Vol. 34,
Issue. 1,
p.
123.
Swanepoel, Konrad J.
2009.
Unit Distances and Diameters in Euclidean Spaces.
Discrete & Computational Geometry,
Vol. 41,
Issue. 1,
p.
1.
LEFMANN, HANNO
PERSON, YURY
RÖDL, VOJTĚCH
and
SCHACHT, MATHIAS
2009.
On Colourings of Hypergraphs Without Monochromatic Fano Planes.
Combinatorics, Probability and Computing,
Vol. 18,
Issue. 5,
p.
803.
Keevash, Peter
and
Mubayi, Dhruv
2010.
Set systems without a simplex or a cluster.
Combinatorica,
Vol. 30,
Issue. 2,
p.
175.
Füredi, Zoltan
Kantor, Ida
Monti, Angelo
and
Sinaimeri, Blerina
2010.
On Reverse-Free Codes and Permutations.
SIAM Journal on Discrete Mathematics,
Vol. 24,
Issue. 3,
p.
964.
Marchant, Edward
and
Thomason, Andrew
2010.
Fete of Combinatorics and Computer Science.
Vol. 20,
Issue. ,
p.
239.
Pikhurko, Oleg
2011.
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges.
European Journal of Combinatorics,
Vol. 32,
Issue. 7,
p.
1142.
Balogh, József
and
Mubayi, Dhruv
2012.
Almost all triangle-free triple systems are tripartite.
Combinatorica,
Vol. 32,
Issue. 2,
p.
143.