Positive Co‐Degree Density of Hypergraphs
The minimum positive co-degree of a nonempty r-graph H, denoted $δ^+_{r-1}$ (H), is the maximum k such that if S is an (r-1)-set contained in a hyperedge of H, then is contained in at least distinct hyperedges of H. Given an r-graph F, we introduce the positive co-degree Turán number co + ex(n, F) as the maximum positive co-degree $δ^+_{r-1}$ (H) over all n-vertex r-graphs H that do not contain F as a subhypergraph. In this paper, we concentrate on the behavior of co + ex(n, F) for 3-graphs F. In particular, we determine asymptotics and bounds for several well-known concrete 3-graphs F (e.g. $K^-_4$ and the Fano plane). Here, we also show that, for r-graphs, the limit γ + (F)≔ lim$_{n→∞}$ $\frac{co^+ex(n, F)}{n}$ exists, and “jumps” from 0 to 1/r, that is, it never takes on values in the interval . Moreover, we characterize which r-graphs F have γ + (F) = 0. Our motivation comes primarily from the study of (ordinary) co-degree Turán numbers where a number of results have been proved that inspire our results.