Asymptotics for Turan numbers of cycles in 3-uniform linear hypergraphs

摘要

Let F be a family of 3-uniform linear hypergraphs. The linear Turan number of F is the maximum possible number of edges in a 3-uniform linear hypergraph on n vertices which contains no member of F as a subhypergraph.