Hai-Zhen Ren

Linear Turán Bounds for Hypertrees and Tight Bounds for 2P2 in Linear 3-Graph

Let H be an m-uniform hypergraph (m-graph), where m≥2. If any two hyperedges in H share at most one vertex, then H is an m-uniform linear hypergraph. Let F be a given family of m-graphs. H is called F-free if H does not contain any hypergraph in F as it is subhypergraph. The linear Turán number exmlin(n,F) of F is defi...