Answers are grounded in this paper and cite their sources.
Let Hₙ be a k-graph on n vertices. For 0 ≤ <k and an -subset T of V(Hₙ), define the degree (T) of T to be the number of (k-)-subsets S such that S ∪ T is an edge in Hₙ. Let the minimum -degree of Hₙ be δ_(Hₙ) = min \ (T) : T ⊆ V(Hₙ) and |T|=\. Given a family F of k-graphs, the -degree Turán number ex_(n, F) is the largest δ_(Hₙ) over all F-free k-graphs Hₙ on n vertices. Hence, ex₀(n, F) is the Turán number. We define -degree Turán density to be πᵏ_(F) = n → ∞ ex_(n, F ) n- k. In this paper, we show that for k> >1, the set of π_ᵏ(F) is dense in the interval $[0,1)$. Hence, there is no “jump” for -degree Turán density when k> >1. We also give a lower bound on π_ᵏ(F) in terms of an ordinary Turán density.
No takes yet. Share an insight, caveat, or question.
Lo et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: