Papers
Topics
Authors
Recent
Search
2000 character limit reached

On local Turán density problems of hypergraphs

Published 1 Mar 2023 in math.CO | (2303.00427v1)

Abstract: For integers qpr2q\ge p\ge r\ge2, we say that an rr-uniform hypergraph HH has property (q,p)(q,p), if for any qq-vertex subset QQ of V(H)V(H), there exists a pp-vertex subset PP of QQ spanning a clique in HH. Let Tr(n,q,p)=mine(H):H([n]r),H has property (q,p)T_{r}(n,q,p)=\min{ e(H): H\subset \binom{[n]}{r}, H \text{~has property~} (q,p)}. The local Tur\'an density about property (q,p)(q,p) in rr-uniform hypergraphs is defined as tr(q,p)=limnTr(n,q,p)/(nr)t_{r}(q,p)=\lim_{n\to \infty}T_{r}(n,q,p)/\binom{n}{r}. Frankl, Huang and R\"odl [J. Comb. Theory, Ser. A, 177 (2021)] showed that limptr(ap+1,p+1)=1a<sup>r1\lim_{p\to\infty}t_{r}(ap+1,p+1)=\frac{1}{a<sup>{r-1}} for positive integer aa and t3(2p+1,p+1)=14t_{3}(2p+1,p+1)=\frac{1}{4} for all p3p\ge 3 and asked the question that determining the value of limptr(γp+1,p+1)\lim_{p\to\infty}t_{r}(\gamma p+1,p+1), where γ1\gamma\ge 1 is a real number. Based on the study of hypergraph Tur\'an densities, we determine some exact values of local Tur\'an densities and answer their question partially; in particular, our results imply that the equality in their question about exact values does not hold in general.

Authors (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.