Extremal problems in uniformly dense hypergraphs and digraphs
Hao Lin, Guanghui Wang, Wenling Zhou, Yiming Zhou

TL;DR
This paper connects extremal problems in digraphs to uniform Turán densities of 3-uniform hypergraphs, providing new verifiable conditions and examples for specific density values, advancing understanding of hypergraph extremal problems.
Contribution
It establishes a novel link between digraph extremal results and hypergraph Turán densities, offering the first verifiable conditions and explicit examples for certain density values.
Findings
Identified conditions for -graphs with Ture1n density (r-1)/r and (r-1)^2/r^2.
Constructed 3-graphs satisfying a sufficient condition for Ture1n density 4/27.
Provided a short proof for the existence of 3-graphs with Tura9n density 1/27.
Abstract
The uniform Tur\'an density of a -uniform hypergraph (or -graph) is the supremum of all such that there exist infinitely many -free -graphs in which every induced subhypergraph on a linearly sized vertex set has edge density at least . Determining for a given -graph was proposed by Erd\H{o}s and S\'os in the 1980s, yet only a few cases are known. In particular, it remains open whether can occur as a value of . In this paper, we establish a novel connection between Tur\'an-type extremal problems for digraphs and uniform Tur\'an densities of -graphs. Using digraph extremal results, we give the first verifiable conditions for -graphs with and for all , and identify the corresponding -graphs. In particular, these -graph classes contain some…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Markov Chains and Monte Carlo Methods
