Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.jctb.2006.11.003 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
turán problem,complete k-partite k-graph,new generalization,pairwise intersect,k-graph fan,mantel's theorem,uniform hypergraph,k edge,general theorem,equal part,extremal example,larger class,n-vertex k-graph,maximum number | Discrete mathematics,Pairwise comparison,Graph,Combinatorics,Vertex (geometry),Mathematics,The Intersect,Special case | Journal |
Volume | Issue | ISSN |
97 | 4 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
14 | 0.91 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dhruv Mubayi | 1 | 579 | 73.95 |
| Oleg Pikhurko | 2 | 318 | 47.03 |