Turán densities of some hypergraphs related to Kkk+1

Abstract

Let Bi(k) be the k-uniform hypergraph whose vertex set is of the form S U T, where |S| = i, |T| = k - 1, and S∩T = φ, and whose edges are the k-subsets of S∪T that contain either S or T. We derive upper and lower bounds for the Turan density of Bi(k) that are close to each other as k → ∞. We also obtain asymptotically tight bounds for the Turan density of several other infinite families of hypergraphs. The constructions that imply the lower bounds are derived from elementary number theory by probabilistic arguments, and the upper bounds follow from some results of de Caen, Sidorenko, and Keevash. Copyright © by SIAM.

Publication Title

SIAM Journal on Discrete Mathematics

Link to Full Text

Share

COinS