Extremal problems whose solutions are the blowups of the small Witt-designs
Journal of Combinatorial Theory Series A
Coloring nearly-disjoint hypergraphs with n+o(n) colors
Journal of Combinatorial Theory Series A
Stability theorems for cancellative hypergraphs
Journal of Combinatorial Theory Series B
Regularity lemma for k-uniform hypergraphs
Random Structures & Algorithms
Triple Systems Not Containing a Fano Configuration
Combinatorics, Probability and Computing
Applications of the regularity lemma for uniform hypergraphs
Random Structures & Algorithms
The counting lemma for regular k-uniform hypergraphs
Random Structures & Algorithms
The Turán Number Of The Fano Plane
Combinatorica
A hypergraph extension of Turán's theorem
Journal of Combinatorial Theory Series B
On A Hypergraph Turán Problem Of Frankl
Combinatorica
An exact Turán result for the generalized triangle
Combinatorica
Two-regular subgraphs of hypergraphs
Journal of Combinatorial Theory Series B
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
European Journal of Combinatorics
Counting substructures II: Hypergraphs
Combinatorica
| Hi-index | 0.00 |
Let the k-graph Fan^k consist of k edges that pairwise intersect exactly in one vertex x, plus one more edge intersecting each of these edges in a vertex different from x. We prove that, for n sufficiently large, the maximum number of edges in an n-vertex k-graph containing no copy of Fan^k is @?"i"="1^k@?n+i-1k@?, which equals the number of edges in a complete k-partite k-graph with almost equal parts. This is the only extremal example. This result is a special case of our more general theorem that applies to a larger class of excluded configurations.