Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs

Details Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs

2005-10-11

arxiv.org/abs/math/0510227v1

Mathematics

Combinatorics

Accepted by JCTB; publication suspended because of a disagreement over the copyright, see http://www.math.cmu.edu/~pikhurko/Co

Scientific paper

Let l>k>2. Let the k-graph H^k_l 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 Turan's theorem", to appear in J. Combin. Th. (B)] computed asymptotically the Turan 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.

Affiliated with

Also associated with

No associations

Rating

Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49062