Paper Info
Title
Exact computation of the hypergraph Turán function for expanded complete 2-graphs
Abstract
Let l > k ⩾ 3 . Let the k -graph H l ( k ) be obtained from the complete 2-graph K l ( 2 ) by enlarging each edge with a new set of k - 2 vertices. Mubayi [A hypergraph extension of Turán's theorem, J. Combin. Th. (B), to appear] computed asymptotically the Turán function ex ( n , H l ( k ) ) . Here, we determine the exact value of ex ( n , H l ( k ) ) for all sufficiently large n , settling a conjecture of Mubayi.
Year
DOI
Venue
2013
10.1016/j.jctb.2012.09.005
Journal of Combinatorial Theory, Series B
Keywords
Field
DocType
theory ser,computed asymptotically,hypergraph tur,k-graph h,k-2 vertex,exact computation,j. combin,expanded complete 2-graphs,2-graph k,hypergraph extension,large n,exact value,turan function
Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Hypergraph,Conjecture,Mathematics,Computation
Journal
Volume
Issue
ISSN
103
2
Journal of Combinatorial Theory, Series B
Citations 
PageRank 
References 
14
0.83
17
Authors
1
Name
Order
Citations
PageRank
Oleg Pikhurko131847.03