This paper establishes the first explicit values of uniform Turán density for all uniformities, revealing specific hypergraphs with densities 1/4 and inom{r}{2}^{-inom{r}{2}} for every r.
Contribution
It provides the first known explicit values of uniform Ture1n density for all r, advancing understanding of hypergraph extremal problems.
Findings
01
Identified hypergraphs with rac{1}{4} density for all r.
02
Found hypergraphs with density inom{r}{2}^{-inom{r}{2}} for all r.
03
Extended the set of known uniform Ture1n density values to all uniformities.
Abstract
In the 1980s, Erd\H{o}s and S\'os first introduced an extremal problem on hypergraphs with density constraints. Given an r-uniform hypergraph F (or r-graph for short), its uniform Tur\'an density πu(F) is the smallest value of d in which every hypergraph H in which every linear-sized subhypergraph of H has edge density at least d contains F as a subgraph. The first non-zero value of πu(F) was not found until 30 years later. Progress in studying the set of values of the uniform Tur\'an density of r-graphs has been uneven in terms of r: to this day there are infinitely many non-zero values known for r=3, a single non-zero value known for r=4 and none for r≥5. In this paper we obtain the first explicit values of πu for all uniformities, by proving that for every r≥3 there exist r-graphs F with πu(F)=1/4 and with…
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 · Advanced Topology and Set Theory
Full text
Uniform Turán density beyond 3-graphs
Ander Lamaison
Extremal Combinatorics and Probability Group (ECOPRO), Institute for Basic Science (IBS), Daejeon, South Korea. Supported by IBS-R029-C4. Email address: [email protected]
Abstract
In the 1980s, Erdős and Sós first introduced an extremal problem on hypergraphs with density constraints. Given an r-uniform hypergraph F (or r-graph for short), its uniform Turán density π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F) is the smallest value of d in which every hypergraph H in which every linear-sized subhypergraph of H has edge density at least d contains F as a subgraph. The first non-zero value of π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F) was not found until 30 years later.
Progress in studying the set of values of the uniform Turán density of r-graphs has been uneven in terms of r: to this day there are infinitely many non-zero values known for r=3, a single non-zero value known for r=4 and none for r≥5. In this paper we obtain the first explicit values of π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture for all uniformities, by proving that for every r≥3 there exist r-graphs F with π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=1/4 and with π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=(2r)−(2r).
1 Introduction
One of the central types of problem in extremal graph and hypergraph theory is the so-called Turán-type problems. These problems concern the largest number of edges in a hypergraph with a prescribed number of vertices and avoiding a fixed subgraph.
One of the most basic Turán-type problems is determining the Turán density of hypergraphs. Let F be an r-uniform hypergraph (or r-graph for short). Its Turán density, denoted by π(F), is the largest real number d such that, for all ε>0 and for all N, there exists an r-graph H on n≥N vertices with edge density at least d−ε (i.e. has at least (d−ε)(rn) edges) and which is F-free (i.e. does not contain F as a subgraph).
Erdős and Stone [5] showed that the Turán density of graphs is determined by the chromatic number χ(G), specifically π(G)=χ(G)−1χ(G)−2. No similar characterization is known or conjectured in the case of r-graphs with r≥3. Erdős offered 500fordeterminingtheTuraˊndensityofanycompletehypergraphK_{n}^{(r)}withn>r\geq 3,and1000 for determining all values of π(Kn(r)). No such value is known as of today, and even the case F=K4(3)−, the hypergraph obtained from K4(3) by removing one edge, remains open.
For many choices of F, the densest F-free hypergraphs have edges which are very unevenly distributed within its vertex set. For example, if F=K4(3), the conjectured value of π(F) is 5/9, and Turán [22] constructed F-free 3-graphs Hn on n vertices with edge density tending to 5/9. In Hn, the vertex set can be split into three independent sets of size n/3. In other words, despite the global edge density being 5/9, the local edge-density in some large subsets of the vertex set is as low as [math].
We will now formalize this notion of local density. Let H be an r-graph. We say that H is (d,ε,\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture)-dense if every set S⊆V(H) with ∣S∣≥ε∣V(H)∣ satisfies e(S)≥(d−ε)(r∣S∣). We say that a sequence of hypergraphs {Hn}n=1∞ is locally d-dense if there exists a sequence {εn}n=1∞ such that each Hn is (d,εn,\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture)-dense, εn→0, and ∣V(Hn)∣→∞.
Definition 1**.**
The uniform Turán density of an r-graph F, denoted by π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F), is the maximum value of d such that there exists a locally d-dense sequence of F-free r-graphs.
Erdős and Sós[4] introduced uniform Turán density in the 1980s, but it would take over thirty years for the first non-zero value to be determined, when Glebov, Král’ and Volec [8] proved that π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(K4(3)−)=1/4.
The uniform Turán density of every graph is 0: for every ε>0, every locally ε-dense sequence of graphs contains arbitrarily large cliques. Therefore, the smallest value of r for which the uniform Turán density of r-graphs is a non-trivial parameter is 3. There are several families of 3-graphs whose uniform Turán density is known, such as tight cycles [2] and large stars [12].
In addition to individual values of π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F), other results have been proved about the uniform Turán density of 3-graphs. Reiher, Rödl and Schacht [16] characterized the 3-graphs F with π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=0, and proved that the uniform Turán density of a 3-graph cannot lie in the interval (0,1/27). Garbe, Král’ and the author [7] constructed 3-graphs F with π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=1/27, meaning that 1/27 is in fact the minimum positive value of π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture in 3-graphs.
One reason why so many results have been proved about the uniform Turán density of 3-graphs is the development of certain methods for its study. The first systematic method was described by Reiher [15], who introduced a structure called reduced hypergraphs, and showed its connection to uniform Turán density. Another useful tool is palettes, a way of generating locally dense sequences of 3-graphs introduced by Reiher based on constructions by Erdős and Hajnal [3] and Rödl [19]. Recently, the author [11] proved that, for any 3-graph F, π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F) is the supremum of the densities of palette constructions not containing F.
In contrast, very little is known about the uniform Turán density of r-graphs with r≥4. Kohayakawa, Nagle, Rödl and Schacht [10] proved that if F is linear (i.e. no two edges intersect in more than one vertex) then π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=0. There is only one non-zero value of π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F) known, which was found as a byproduct of its classical Turán density. Let F be the unique 4-graph on five vertices with three edges. Gunderson and Semeraro [9] proved that π(F)=1/4. The sequence of F-free hypergraphs with edge density 1/4 that they generated is also locally 1/4-dense, so as a corollary, one can deduce that π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=1/4.
Among the properties of the uniform Turán density of r-graphs that remain unknown for r≥4, one of them is the characterization of the hypergraphs F satisfying π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=0. We will propose one such characterization in Conjecture 20.
The structure yielded by the hypergraph regularity lemma, which lies at the heart of Reiher’s reduced hypergraphs, is one of the causes behind this difficulty increase when r≥4. The regularity lemma produces a layered partition, in which we obtain a partition of each of the sets (1V),(2V),…,(r−1V), and thanks to a tehnique used by Reiher, the first layer can be ‘tamed’ in locally dense sequences of hypergraphs. This means that for r=3, one only needs to pay attention to one layer of the regularity partition, whereas for r≥4 there are multiple layers with a non-trivial behavior.
There are other exact results known using more restrictive notions of local density, introduced by Reiher, Rödl and Schacht [17] and whose corresponding Turán densities are denoted by πi(F). In this hierarchy, π0(F) and π1(F) correspond to the classical and uniform Turán densities, respectively. Lin, Wang and Zhou [13] showed that the minimum positive value of πr−2(F) among r-graphs F is r−r.
In this paper we find the first non-zero values of the uniform Turán density of r-graphs for general r. First we will prove that 1/4 is a value for every r≥3, generalizing the results from Glebov, Král’ and Volec for r=3, and by Gunderson and Semeraro for r=4.
Theorem 2**.**
For every r≥3 there exists an r-graph F with π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=1/4.
Let πr=(2r)−(2r). We will also prove the existence of r-graphs with uniform Turán density equal to πr, generalizing the case r=3 by Garbe, Král’ and the author. This number is significant because we conjecture that this is the minimum positive value of the uniform Turán density of r-graphs. In other words, we expect the set of values of the uniform Turán density to present a ‘jump’: for every r-graph F we either have π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=0 or π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)≥πr. The case r=3 was proved by Reiher, Rödl and Schacht [16]. This will be discussed in the concluding remarks.
Theorem 3**.**
For every r≥3 there exists an r-graph F with π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=(2r)−(2r).
The organization of this paper is as follows. In Section 2 we will list some results that will be used in the proof of our main theorems. Section 3 will introduce the concept of descriptive sequences, and will split Theorem 2 and Theorem 3 each into an ‘existence’ statement and a ‘density’ statement. The existence statements will be proved in Section 4. Two important tools in the proof of the density statements, namely reduced hypergraphs and hypergraph regularity, will be introduced in Section 5 and Section 6, respectively. Section 7 will be devoted to proving the density statements. Finally, in Section 8 we will present some concluding remarks.
2 Preliminaries
One tool that we will use is Ramsey’s theorem, which allows us to find monochromatic cliques in edge colorings of complete hypergraphs.
Let r, m and k be positive integers. There exists a number n such that, whenever the edges of a complete r-uniform hypergraph on n vertices are colored using k colors, there exists a subset of m vertices in which every edge receives the same color.
We will denote the least value of n with this property as Rr(m,k). These numbers are often referred to as Ramsey numbers.
Definition 5**.**
Let S⊆Zd be a set, and let ≺ be a linear order on the set S. We say that S is sorted by the i-th coordinate if for any x=(x1,…,xd),y=(y1,…,yd)∈S, if xi<yi holds then x≺y. We say that S is inversely sorted by the i-th coordinate if for any x,y∈S, if xi<yi holds then x≻y.
We say that S is sorted by layers if there exists some i such that S is sorted by the i-th coordinate or inversely sorted by the i-th coordinate.
The following lemma follows directly from a theorem of Fishburn and Graham [6], by noting that the lexicographic order defined in that paper is in particular sorted by layers.
Lemma 6**.**
For every k,d∈N there exists N=N(k,d) with the following property: for every linear ordering ≺ on the set [N]d, there exist sets S1,S2,…,Sd, each with size k, such that S1×S2×⋯×Sd is sorted by layers by ≺.
Observe that when d=1, setting N=(k−1)2+1, we obtain the Erdős-Szekeres theorem: any ordering of [N] contains a monotone subsequence with k terms.
The next lemma allows us to find subsets of ordered sets which span disjoint intervals. The method used in this proof has been implicitly used before (see for example [1], which is a result in the same spirit), but perhaps the most explicit description of the algorithm can be found in the solution of Problem 5 from the International Mathematical Olympiad 2017.
Lemma 7**.**
Let k be a positive integer. Let A1,A2,…,Ak be disjoint finite sets, and let A be their union. For every linear order ≺ on A, there exist sets B1,…,Bk with Bi⊆Ai and ∣Bi∣≥∣Ai∣/k, satisfying the following property: for any i=j there do not exist elements x,z∈Bi and y∈Bj such that x≺y≺z.
Proof.
We proceed by induction on k. The case k=1 is trivial. Now assume that the statement holds for k−1. We can assume that no set Ai is empty, otherwise apply induction to the remaining sets. Consider a set C, which is initially empty. Add elements to C one by one, from smallest to largest, until the first time some set Ai satisfies ∣Ai∩C∣≥∣Ai∣/k. W.l.o.g. we can assume i=k. We set Bk=Ak∩C, and Ai′=Ai∖C for all 1≤i≤k−1.
By construction there is no element of Bk between two elements of Ai′, and vice versa. Also, since the sets Ai are all disjoint, by the minimality of C we have that ∣Ai∩C∣<∣Ai∣/k, and thus ∣Ai′∣>kk−1∣Ai∣. Applying the induction hypothesis to A1′,…,Ak−1′ we obtain the desired sets B1,…,Bk−1, which satisfy ∣Bi∣≥∣Ai′∣/(k−1)≥∣Ai∣/k.∎
Finally, we will use a family of linear hypergraphs that satisfies a certain quasirandomness condition. Remember that a hypergraph is said to be linear if every pair of edges intersects in at most one vertex.
Definition 8**.**
A sequence of r-graphs {Hn}n=1∞ is said to be nowhere-empty if for every c>0 there exists n0 with the following property: for all n≥n0, for all disjoint subsets S1,S2,…,Sr of vertices, each with size at least c∣V(Hn)∣, there exists some edge of Hn that intersects all sets Si.
Lemma 9**.**
Let r≥3. There exists a nowhere-empty sequence of linear r-graphs {Hn}n=1∞, where each Hn has n vertices.
Proof.
We will start by considering the Erdős-Rényi random hypergraph Gn=G(r)(n,p), with p=n−r+3/2. This is the random hypergraph obtained from a set of n vertices, where for every r-tuple of vertices we add an edge with probability p, independently of the other choices. In the following, by “with high probability” we mean with probability tending to 1 as n tends to infinity.
Let T be the set of all edges of Gn that intersect another edge in at least two vertices. It is clear that Gn−T is a linear hypergraph. We claim that, with high probability, ∣T∣≤n5/4. Indeed, let us count the number of pairs of edges intersecting in at least two vertices. Every such pair can be written in the form (v1,v2,w1,w2,…,wr−2,w1′,w2′,…,wr−2′), where the two edges are v1v2w1w2…wr−2 and v1v2w1′w2′…wr−2′. Such an expression is generally not unique: the order of the vi,wi and wi′ might be altered, and if the two edges intersect on more than two vertices then the choice of v1 and v2 is also not unique. What matters is that every pair of edges with intersection at least two admits such an expression.
Given a 2r−2-tuple of vertices, the probability that it corresponds in this way to a pair of edges of Gn is at most p2. Therefore, by linearity of expectation, the expected number of pairs of intersecting edges is at most n2r−2p2=n. By Markov’s inequality, the probability that there are at least n5/4/2 pairs of intersecting edges is at most 2n−1/4. Thus, with high probability ∣T∣≤n5/4.
Next we will show that, with high probability, for every choice of disjoint S1,S2,…,Sr, each with size at least n1−6r1, there is an edge of Gn−T that intersects each Si. This is enough to prove our statement by taking Hn=Gn−T. Observe that there are at most (r+1)n choices of the subsets Si: for each vertex, we can decide whether to include it in one of the sets Si, and if so in which one, yielding r+1 options for each vertex. Therefore, it is enough to show that for each fixed choice of sets Si, conditioned on ∣T∣≤n5/4, the probability that there does not exist an edge of Gn−T intersecting every Si is o((r+1)−n).
Indeed, the fact that no edge of Gn−T intersects all Si implies that at most ∣T∣ edges of Gn intersect every Si (and all of them belong to T). In particular, if ∣T∣≤n5/4, then no more than n5/4 edges of Gn intersect every Si. Observe that the number of edges of Gn that intersect every Si behaves like a binomial distribution: for each of the ∣S1∣⋅∣S2∣⋅⋯⋅∣Sr∣ choices of one vertex from each subset, whether or not this r-tuple forms an edge of Gn is independent and happens with probability p.
The probability that fewer than n5/4 of these r-tuples become an edge of Gn is at most
[TABLE]
With high probability, ∣T∣≤n5/4 and all choices of S1,S2,…,Sr span more than n5/4 edges of Gn, so it spans at least one edge of Hn. This concludes our proof.∎
3 Consistent orderings and descriptive sequences
We will now present some notions relating to hypergraphs, which will be necessary to describe the family of hypergraphs for which we will give the exact value of the uniform Turán density.
Kohayakawa, Nagle, Rödl and Schacht [10] showed that the uniform Turán density of every linear hypergraph is 0. Therefore, in order to keep edge intersections as simple as possible, we will define the following class of hypergraphs. We say that a hypergraph H is quasi-linear if for every edge e∈E(H) there exists a unique other edge f such that ∣e∩f∣=2, and all f′∈E(H)∖{e,f} satisfy ∣e∩f′∣≤1. In other words, each edge has a unique twin, twin pairs of edges have intersection size two, and non-twin pairs of edges have intersection size at most one.
We will consider orderings of the vertex set of H. We will be interested in the relative order of the vertices of e∪f, for all twin pairs of edges {e,f}. The relative order of the vertices within an edge plays an important role important role in palettes, which are used to study the uniform Turán density of 3-graphs; the notions that we present here are inspired by palettes.
Given a set S of k elements, a pair of elements {u,v}∈S, an ordering ⪯ of S and a pair of numbers {i,j}∈(2[k]), we say that {u,v} play the role {i,j} in S if, when the elements of S are sorted as w1≺w2≺⋯≺wk, we have {wi,wj}={u,v}. We will use this notion most commonly in graphs with a vertex ordering, in order to describe the role of a pair of vertices within an edge.
We say that a quasi-linear hypergraph H with a linear vertex order ⪯ is consistently ordered if for every twin pair of edges {e,f}, the pair e∩f plays the same role in e as in f. We say that H is consistent if there exists a vertex order on which it is consistently ordered, and we say that H is inconsistent otherwise.
We will introduce a way of describing the relative position of all vertices in a twin pair of edges in a vertex-ordered quasi-linear graph. A descriptive sequence of order k is a sequence σ=(s1,s2,…,s2k−2) of 2k−2 letters from {X,Y,Z}, containing k−2 letters X, k−2 letters Y and two letters Z. We say that a descriptive sequence is consistent if the pair of Z entries plays the same role in the set of k entries {X,Z} as in the set of k entries {Y,Z}. We say that the descriptive sequence is inconsistent otherwise. For example, if k=5, the sequence XYYXZZYX is consistent, because the pair of Z entries play the role {3,4} among both the {X,Z} and the {Y,Z} entries. On the other hand, the sequence YXZXYXZY is inconsistent, since the pair of Z entries plays the role {2,5} among the {X,Z} entries and the role {2,4} among the {Y,Z} entries.
Given two edges e,f with ∣e∩f∣=2 in a vertex-ordered graph H, we say that the descriptive sequence σ=(s1,s2,…,s2k−2) describes the pair {e,f} if, when the vertices of e∪f are sorted as w1≺w2≺⋯≺w2k−2, the indices of the vertices of e correspond to the indices of the entries {X,Z} or the entries {Y,Z}, and the same holds for the indices of the vertices of f. In other words, one of the following situations hold:
[TABLE]
We say that a quasi-linear hypergraph H admits the descriptive sequence σ if there exists a linear order of its vertex set in which every twin pair of edges {e,f} is described by σ.
A particularly interesting descriptive sequence is XX…XZZYY…Y. Given a graph with an ordered vertex set, we will call the first two vertices of an edge its head, and the last two vertices its tail. Observe that here the words head and tail each refers to a pair of vertices, rather than a single vertex. Then the sequence XX…XZZYY…Y describes a pair of edges if and only if the head of one edge is the tail of the other.
We say that a hypergraph is head-tail-mixing if for every linear order of its vertex set there exist edges e,f such that the head of e is the tail of f.
We now have all the required definitions to characterize the families of hypergraphs in which our theorems apply
Theorem 10**.**
For r≥3 every quasi-linear, head-tail-mixing r-graph F which admits the descriptive sequence XX…XZZYY…Y satisfies πu(F)=1/4.
Theorem 11**.**
For r≥3 every quasi-linear, inconsistent r-graph F which admits all inconsistent descriptive sequences of order r satisfies πu(F)=πr.
Of course, in order to be able to say that 1/4 and πr are uniform Turán density values we need the corresponding existence theorems:
Theorem 12**.**
For every r≥3 there exists a quasi-linear, head-tail-mixing r-graph F which admits the descriptive sequence XX…XZZYY…Y,.
Theorem 13**.**
For every r≥3 there exists a quasi-linear, inconsistent r-graph F which admits all inconsistent descriptive sequences of order r.
These four theorems together directly imply Theorem 2 and Theorem 3.
4 Proof of existence theorems
In this section we will prove Theorems 12 and 13. The proofs of both theorems follow a similar structure, but the former is simpler, since at a certain step it uses the Erdős-Szekeres theorem while the proof of Theorem 13 uses Lemma 6. In both cases the construction of the r-graph is obtained by starting with the sequence of nowhere-empty 2r−2-graphs from Lemma 9, and subdividing some or all edges into two edges of size r intersecting in two vertices. This process is once again simpler in the proof of Theorem 12 than Theorem 13.
Let {Hn′} be a nowhere-empty sequence of 2r−2-graphs, whose existence is guaranteed by Lemma 9. We can assume that the vertex set of Hn′ is [n]. Construct the r-graph Hn from Hn′ using the following procedure. The vertex set is [n]. For every edge e∈E(Hn′), if v1<v2<⋯<v2r−2 are the vertices of e, then add to Hn the two edges v1v2…vr and vr−1vr…v2r−2.
Since the hypergraph Hn′ is linear, the only pairs of edges of Hn that intersect in two vertices are those that are generated by the same edge of Hn′, otherwise the intersection size is at most 1. Thus Hn is quasi-linear, and the twin pairs are precisely the pairs of edges originating from the same edge of Hn′. Moreover, in the natural order of [n], in every twin pair of edges, the head of one edge is the tail of the other, therefore Hn admits the descriptive sequence XX…XZZYY…Y. To conclude the proof of Theorem 12, we will prove that for some value of n the hypergraph Hn is head-tail-mixing.
Let t=2r−2, and let n be a large enough multiple of t2. Let ⪯ be a linear order on [n]=V(Hn). Our goal is to show that, when sorting the vertices by ⪯, there exist two edges e,f such that the head of e is the tail of f.
Divide [n] into t2 intervals of equal length, denoted by I1,I2,…,It2. We apply Lemma 7, with k=t2 and Ai=Ii, to find subsets Bi⊂Ii, each with size at least ∣Ii∣/t2=n/t4, such that for i=j there is no element of Bi which lies between two elements of Bj in the order ⪯. That means that if for some x∈Bi and y∈Bj we have x≺y, then this holds for all choices of x and y within the sets Bi and Bj. In this case we write Bi≺Bj.
Consider the ordering that ⪯ induces on the sequence B1,B2,…,Bt2. By the Erdős-Szekeres theorem, there is a monotone subsequence Bi1,Bi2,…,Bit of length t. On every set consisting of one vertex from each Bij, the order ⪯ is monotone.
Since the family of hypergraphs Hn′ is nowhere-empty, for n large enough there exists an edge e′∈E(Hn′) with one vertex in each set Bij. Consider the two edges e,f∈E(Hn) that were generated from e′. In the natural order of the integers, w.l.o.g. the head of e is the tail of f. But because the ⪯ order is monotone in e′, the order of its vertices in ⪯ is either the same as in the natural order or its reverse. In either case, the head of one of e,f is the tail of the other, concluding the proof that Hn is head-tail-mixing. ∎
In the case of Theorem 13, there are some changes with respect to the proof above. In order to account for the many different vertex orders that yield each of the inconsistent descriptive sequences, we will consider that the vertex set of our hypergraph forms a multidimensional grid, and that each descriptive sequence is obtained by sorting the vertices by one of its coordinates. This multidimensionality of the vertex set will mean that, instead of the relatively simple Erdős-Szekeres theorem, we will use Lemma 6. In addition, not all edges of Hn′ will become two edges of Hn. The reason for this is that, if we do split all edges, it might not be possible for the new twin pair of edges to be described by the correct descriptive sequence when sorting by each of the coordinates.
Let t=2r−2. Let d be the number of inconsistent descriptive sequences of order r, and let σ1,σ2,…,σd be a list containing each of them. Set N=N(t,d) as in Lemma 6. We set m to be a large enough integer divisible by N. Finally, set n=md.
Consider the nowhere-empty sequence of linear t-graphs {Hi′}i=1∞. We identify the vertices of Hn′ with the elements of [m]d. We will form Hn from Hn′ by turning some (but not all) edges from Hn′ into twin pairs of edges in Hn. We now explain the procedure for deciding whether to split an edge and how to do so.
Let e be an edge of Hn′. If there exists a value i∈[d] such that two vertices of e have the same value of their i-th coordinate, discard this edge. Therefore, we will assume that for every i, the i-th coordinate of all vertices of e is different.
Remember that each descriptive seqence σi is a sequence of t=2r−2 symbols, out of which r−2 are X, r−2 are Y and two are Z. Suppose that it is possible to label r−2 vertices of e by X, r−2 vertices by Y and two by Z in such a way that, for every i∈[d], when the vertices of e are sorted by their i-th coordinate, the resulting label sequence is precisely σi. In that case, add to Hn two edges, one by taking the vertices labeled X and Z, and the other by taking the vertices labeled Y and Z. If no such labeling exists, discard this edge.
Since the hypergraph Hn′ is linear, the only pairs of edges of Hn that intersect in two vertices are those that are generated by the same edge of Hn′, otherwise the intersection size is at most 1. Thus Hn is quasi-linear, and the twin pairs of edges are precisely the pairs of edges originating from the same edge of Hn′. Moreover, for every inconsistent desctiptive sequence σi, when the vertices of Hn are sorted by their i-th coordinate, every twin pair of edges is described by σi, meaning that Hn admits all inconsistent descriptive sequences. To conclude the proof of Theorem 13, we will show that for some n the hypergraph Hn is inconsistent.
Let ⪯ be a linear order on the vertices of Hn. Our goal is to show that there exist edges e and f, with intersection size two, such that e∩f plays a different role in e and in f.
Subdivide [m] into N equal intervals, denoted I1,…,IN from smallest to largest. For each vector a=(a1,…,ad)∈[N]d, we can write Ia=Ia1×⋯×Iad. These sets Ia form a partition of the vertex set of Hn′, and each has size (m/N)d=n/Nd.
We apply Lemma 7 to the Nd sets Ia to find subsets Ba⊆Ia, each with size at least ∣Ba∣≥∣Ia∣/Nd=n/N2d, such that for every a=b no element of Ba lies between two elements of Bb in the ordering ⪯. Because of this, ⪯ induces a linear order on the family of sets Ba.
If we identify the set Ba with its index a, we can apply Lemma 6 to this ordering to find sets S1,…,Sd, each with size t, such that the family of sets Ia with a∈S1×⋯×St is sorted by layers. W.l.o.g. let us assume that the family of sets is sorted or inversely sorted by the first coordinate, as all other cases are analogous.
Next we define vectors X1,…,Xr−2,Y1,…,Yr−2,Z1,Z2∈[N]d. For each symbol W∈{X,Y,Z}, each index j and each i∈[d], let Wji∈[t] be the position of the j-th letter W in the descriptive sequence σi. Let the i-th coordinate in Wj be the Wji-th smallest element of Si. Notice that all vectors wj lie in S1×⋯×Sd, and when sorted by their i-th coordinate, the letter sequence produced is precisely σi.
Because the sequence {Hn′}n=1∞ is nowhere-empty, and ∣Ba∣≥n/N2d, for n large enough there exists an edge e′∈E(Hn′) which has one vertex in each of the sets BX1,…BXr−2,BY1,…,BYr−2,BZ1,BZ2. If we label each vertex of e′ with the letter in {X,Y,Z} of the corresponding set, then for every i∈[d], when we sort the vertices of e′ by the i-th coordinate, the resulting letter sequence is σi. That means that e′ contains a twin pair of edges of Hn, namely those with labels X,Z and Y,Z.
We return to the vertex ordering ⪯. Remember that the sets Ba with a∈S1×⋯×Sd are either sorted or inversely sorted by the first coordinate. As a consequence, the vertices of e′ are either in increasing or decreasing order of their first coordinate. This means that either the inconsistent descriptive sequence σ1 or its reverse describe the twin pair e,f. In either case the role of e∩f in each of the edges e and f with the ordering ⪯ is different, as we wanted to show. We conclude that Hn is inconsistent, finishing the proof of Theorem 13.
∎
5 Reduced hypergraphs
In the proof of our existence theorems we will use auxiliary hypergraphs called (k,r)-reduced graphs. These graphs are a generalization of the n-reduced hypergraphs introduced by Reiher in [15], which played a crucial role in many proofs related to uniform Turán density. Their importance lies on their relation to the partitions obtained in the hypergraph regularity lemma.
A (k,r)-reduced hypergraph is an (2r)-graph H whose vertex set is partitioned into (2k) parts Vi,j, with 1≤i<j≤k. For simplicity of writing we will not care about the order of the subindices, so Vi,j and Vj,i will denote the same set. For each edge e∈E(H) there exist r indices t1,t2,…,tr, such that e contains exactly one vertex in each set Vti,tj for each 1≤i<j≤r.
Given indices 1≤t1<t2<⋯<tr≤k, the constituent At1,t2,…,tr is the (2r)-partite (2r)-graph induced on the vertex sets Vti,tj with 1≤i<j≤r. We say that H has density at least d if all constituents have edge density at least d.
We will briefly describe the connection between reduced graphs and hypergraph regularity, although it will necessitate the use of notation that will be introduced in Section 6. These reduced graphs can be seen as the result of contracting each class of the partition P(2) of the pairs of vertices of a large r-graph H′ into a single vertex. If the edge density in H′ between any r parts of P(1) is greater than d, then the resulting (k,r)-reduced hypergraph has density at least d. This will be the case if H′ is taken from a locally d+ε-dense sequence, after some cleanup (see Step 3 from the proof of Theorem 10 and Theorem 11).
Our main lemmas involving (k,r)-reduced hypergraphs will have a connection with descriptive sequences of order r. Let σ=(s1,s2,…,s2r−2) be a descriptive sequence. Let H be a (k,r)-reduced hypergraph, and let t1<t2<⋯<t2r−2 be indices. Let x1<x2<⋯<xr be the indices ti whose corresponding letter si is X or Z, and let y1<y2<⋯<yr be the indices whose corresponding letter is Y or Z. We say that the 2r−2-tuple {t1,t2,…,t2r−2} admits the descriptive sequence σ if there exist edges eX∈Ax1,x2,…,xr and eY∈Ay1,y2,…,yr intersecting in one vertex. The common vertex is in Vti,tj, where i and j are the values such that si=sj=Z.
We can now state our main lemmas on reduced hypergraphs. These lemmas will be used in the proofs of Theorem 10 and Theorem 11 to handle the analysis of the second layer of the regularity partition.
Lemma 14**.**
For every ε>0, r and m there exists k with the following property: if H is a (k,r)-reduced hypergraph with density at least 1/4+ε, then there exists a subset S⊆[k] of m indices such that every 2r−2-tuple of indices in S admits the descriptive sequence XX…XZZYY…Y.
Lemma 15**.**
For every ε>0, r and m there exists k with the following property: if H is a (k,r)-reduced hypergraph with density at least πr+ε, then there exists a subset S⊆[k] of m indices and an inconsistent descriptive sequence σ such that every 2r−2-tuple of indices in S admits σ.
We can assume that m≥2r−2, otherwise the statement holds trivially for k=m. Let q=⌈2/ε⌉. For every r-tuple of indices t1<t2<⋯<tr, we define its signature as follows. Let W be the set of vertices which are incident to at least one edge in At1,t2,…,tr. Then the signature of {t1,t2,…,tr} is the pair
[TABLE]
Note that there are (q+1)2 possible signatures. If k=Rr(m,(q+1)2), there exists a set S of m indices in which every r-tuple of indices has the same signature (a,b).
Next we claim that a+b>q. Let t1<t2<⋯<tr be r indices in S, and let W be as above. Because each edge in At1,t2,…,tr has a vertex in each Vti,tj with 1≤i<j≤r, and that vertex must be in W by definition, the number of edges in At1,t2,…,tr is at most ∏1≤i<j≤r∣Vti,tj∩W∣. On the other hand, because H has density at least 1/4+ε, the number of edges in At1,t2,…,tr is at least (1/4+ε)∏1≤i<j≤r∣Vti,tj∣. Dividing the two equations we obtain that
[TABLE]
From here we conclude (a+b+2)2≥(1+4ε)q2, so a+b>(1+ε)q−2≥q.
We are now ready to prove that S satisfies the property in our statement. Let t1<t2<⋯<t2r−2 be indices in S. Let W1 and W2 be the set of vertices in Vtr−1,tr which are incident to an edge in At1,t2,…,tr and in Atr−1,tr,…,t2r−2, respectively. Then
[TABLE]
There exist edges e1∈At1,t2,…,tr and e2∈Atr−1,tr,…,t2r−2 intersecting in a vertex, so {t1,t2,…,t2r−2} admits the descriptive sequence XX…XZZYY…Y.∎
Let q=⌈2(2r)/ε⌉, let p=Rr(r3,(q+1)(2r)) and let k=R2r−2(max{p,m},32r−2+1). Let H be a (k,r)-reduced hypergraph. Consider each 2r−2-tuple of indices in [k]. If it admits one or more inconsistent descriptive sequences, assign one arbitrarily, otherwise assign it the empty sequence. By the choice of k, there is a subset S of max{p,m} indices where every 2r−2-tuple gets assigned the same sequence. If this sequence is non-empty, we are done. We will assume that they get assigned the empty sequence, and reach a contradiction.
For each r-tuple of indices t1<t2<⋯<tr in S, we define its profile (a1,2,a1,3,…,ar−1,r), where ai,j=⌊q⋅∣Vti,tj∩W∣/∣Vti,tj∣⌋ and W is the set of vertices incident to at least one edge in At1,t2,…,tr. Note that there are at most (q+1)(2r) distinct profiles. By the choice of p, there exists a subset S′⊆S of q3 indices where every r-tuple has the same profile (a1,2,a1,3,…,ar−1,r).
We claim that ∑1≤i<j≤rai,j>1. To see this, let t1<t2<⋯<tr be indices in S′, and let W as above. On the one hand, the number of edges in At1,t2,…,tr is at least (πr+ε)∏1≤i<j≤r∣Vti,tj∣, since H has density at least πr+ε. On the other hand, the number of edges is at most ∏1≤i<j≤r∣Vti,tj∩W∣. Since ∣Vti,tj∣∣Vti,tj∩W∣≤qai,j+1, by the arithmetic-geometric mean inequality we have
[TABLE]
Within S′, choose elements a,b∈S′ and r-tuples of indices R1,2,R1,3,…,Rr−1,r with the following properties:
•
a,b∈Ri,j for all 1≤i<j≤r.
•
The sets Ri,j∖{a,b} are pairwise disjoint.
•
For all 1≤i<j≤r, if t1<t2<⋯<tr are the elements of Ri,j, then ti=a and tj=b.
One way to construct these sets is to start with a family consisting of (2r) sets Ri,j, intersecting in two elements a,b and otherwise disjoint. Define a partial order ⪯ on the union of these sets: for each 1≤i<j≤r, let i−1 elements of Ri,j∖{a,b} be smaller than i, j−i−1 of these elements be larger than i and smaller than j, and the remaining r−j elements be larger than b. This forces the pair {a,b} to play the role {i,j} in Ri,j on any linear extension of ⪯. Pick arbitrarily any such linear extension, and identify the elements of ∪i,jRi,j with elements of S′ in the right order of ⪯.
Let Wi,j be the set of vertices in Va,b incident to at least one edge in ARi,j. We have that ∣Wi,j∣≥ai,j∣Va,b∣, so the sizes of all Wi,j add up to more than ∣Va,b∣. This means that the sets are not disjoint, and there exist (i,j)=(i′,j′) such that Wi,j∩Wi′,j′=∅. There exist edges eX∈ARi,j and eY∈ARi′,j′ intersecting at a vertex of Va,b.
Let t1<t2<⋯<t2r−2 be the elements of Ri,j∪Ri′,j′. Let σ=(s1,s2,…,s2r−2) be the descriptive sequence where si=X if ti∈Ri,j∖Ri′,j′, si=Y if ti∈Ri′,j′∖Ri,j and si=Z if ti∈Ri,j∩Ri′,j′={a,b}. This descriptive sequence is inconsistent, because the pair of Z entries plays the role {i,j} among the entries {X,Z} and the role {i′,j′} among the entries {Y,Z}.
As a consequence, the 2r−2-tuple of indices t1,t2,…,t2r−2 admits the inconsistent descriptive sequence σ. This contradicts the fact that every 2r−2-tuple of indices in S was assigned the empty sequence, finishing the proof.
∎
6 Hypergraph regularity
The proofs of Theorems 10 and 11 are based on the use of the regularity lemma, and its corresponding counting lemma. Throughout the existing literature one can find a multitude of versions and variations of the hypergraph regularity lemma, not all of them equivalent to each other. The formulation used here, as well as all the notation involved, is taken from a survey by Rödl and Schacht [21, 20]. Like most versions of the hypergraph regularity lemma, the statement requires introducing a number of concepts and definitions. The purpose of this section is to introduce and state the hypergraph regularity lemma and the counting lemma, in which we will only care about the number of copies of a certain subgraph being non-zero.
The first concept that we need to introduce is vertex partitions. Let V be a vertex set. Unlike the graph regularity lemma, where we only need to partition V itself, when we apply the regularity lemma to r-graphs, we need additional partitions of sets of pairs of vertices, triples of vertices, and so on up to (r−1)-tuples of vertices. These partitions must be nested, in a sense that we will explain soon.
Generally, we will denote partitions with Fraktur letters such as P, and the parts in those partitions with caligraphic letters such as P. We will write a superindex between parenthesis to indicate the number of vertices in each element of the partitioned set: for example, P(3) denotes a partition of a set of triples of vertices.
Let P(1)={P1(1),…,Pk(1)} be a partition of the vertex set V, and let i be a positive integer. We denote the set of all i-tuples of vertices of V, with at most one vertex from each part of P(1), by Crossi(P(1)).
Let P(1) be a partition of V, and for each 2≤i≤r−1, let P(i) be a partition of Crossi(P(1)). Let P={P(1),P(2),…,P(r−1)}. Given a set I∈Crossi(P(1)), we denote the part of P(i) that contains I by P(i)(I). We say that P is a nested family of partitions if the following holds: for every 2≤i≤r−1, for every P(i)∈P(i) and every P(i−1)∈P(i−1), if some element of P(i) is a superset of some element of P(i−1), then every element of P(i) is a superset of some element of P(i−1). In other words, if we fix a part P(i)∈P(i), pick some T∈P(i), and then consider the family of parts {P(i−1)(T−v)∣v∈T}, that family does not depend on the choice of T.
The concept of polyad will be useful to define how elements of one layer of P are placed with respect to another layer. Given j<i, given a set I∈Crossi(P(1)), we define the j-th polyad of I, denoted by P^(j)(I)={P(j)(J)∣J⊂I,∣J∣=j}. Observe that, by the condition above, in a nested family of partitions, given a class P(i)∈P(i), the i−1-th polyad of all elements of P(i) is the same, and by induction, so is the j-th polyad for any j<i. We define P^(j) to be the set of all j-th polyads of elements of Crossj+1(P(1)).
Given a vector a=(a1,…,ar), we say that the family of partitions P={P(1),…,P(r)} is (r,a)-nested if P(1) consists of a1 parts, and for each 2≤i≤r, for each P^(i−1)∈P^(i−1), there are exactly ai classes in P(i) such that the i−1-th polyad of their elements is P^(i−1). Moreover, we say that P is t-bounded if all entries of a are less than or equal to t.
In the regularity lemma for graphs, we require that the partition is equitable, that is, all the parts have the same number of vertices. Something similar will hold here, except the condition will be more complicated. In a nutshell, we want each element of P^(i−1) to be the (i−1)-th polyad corresponding to roughly the same number of elements of Crossi(P(1)). In order to guarantee this, we need to start discussing the regularity conditions that the final partition will satisfy.
Let i≤k−1, and let H and H′ be an i−1-graph and an i-graph, respectively, on the same vertex set. We denote by Ki(H) the set of i-tuples of vertices I such that I−v∈H for all v∈I. We call this the set of i-cliques of H. In the particular case in which i=2, and H′ is a bipartite graph with a given partition U,V (which is the case for each of the parts of P(2)), we will define K2(H) as only containing the edges from H∩U to H∩V, rather than all pairs of vertices in H (observe that in this case H is a 1-graph, that is, a collection of vertices).
The density of H′ w.r.t. H, denoted by d(H′∣H), as the value
[TABLE]
that is, the proportion of the i-cliques of H which are edges of H′. If H does not contain any i-clique, we take this density to be 0.
Given a collection of β(i−1)-graphs B={H1,H2,…,Hβ}, we define Ki(B)=∪j=1βKi(Hj). Then the density of H′ over B, denoted by d(H′∣B), can be defined analogously.
We say that H′ is (d,ξ,β)-regular w.r.t. H if the following holds for all families B of β subgraphs Q1,Q2,…,Qβ⊆H, if ∣Ki(B)∣≥ξ∣Ki(H)∣, then ∣d(H′∣B)−d∣≤ξ.
Let P be a (r−1,a)-nested family of partitions, and suppose that a1 divides ∣V∣. Let η be a positive real number, and ξ=(ξ2,ξ3,…,ξr−1) be a positive vector. We say that P is (η,ξ,a,β)-equitable if the following three conditions hold:
•
Crossk(P(1))≥(1−η)(kn).
•
All parts of P(1) have equal size.
•
For every 2≤j≤r−1, for every P(j)∈P(j), we have that P(j) is (1/aj,ξj,β)-regular in its polyad P^(j−1)(P(j)).
We are almost ready to state the hypergraph regularity lemma. All that is left to do is define when a hypergraph is regular w.r.t. a partition. We say that H′ is (∗,ξ,β)-regular w.r.t. H if it is (d,ξ,β)-regular for some value of d.
Definition 16** ((∗,ξ,β)-regular w.r.t. P).**
Let ξ be a positive real number and β a positive integer. Suppose that H is an r-uniform hypergraph on vertex set V, and P is an (r−1,a)-nested family of partitions. We say that H is (∗,ξ,β)-regular w.r.t. P if the number of elements K∈Crossr(P(1)) such that H is not (∗,ξ,β)-regular w.r.t. the polyad P^(r−1)(K) is at most ξ∣V(H)∣r.
Theorem 17** (Hypergraph regularity lemma, simplified from [21]).**
Let r≥2 be a fixed integer. For all positive constants η and ξr, all functions β:Nr−1→N, and functions ξ2,ξ3,…,ξr−1, with ξi:Nr−i→(0,1], there exist integers t and n0 for which the following holds:
For every r-uniform hypergraph H on n vertices, where n≥n0, where t! divides n, there exists an (r−1,a)-nested family of partitions P, for some vector a, such that:
•
P* is (η,ξ(a),a,β(a))-equitable and t-bounded, and*
•
H* is (∗,ξr,β(a))-regular w.r.t. P.*
where ξi(a)=ξi(ai,ai+1,…,ar−1).
The counterpart for the regularity lemma is the counting lemma. In this case, since we are only concerned with the existence of a copy of a certain hypergraph F as a subgraph of H, rather than with approximating the number of copies, we can simplify the statement significantly. Moreover, we will state it for a case in which H comes equipped with a nested family of partitions.
The key ingredient of the hypergraph counting lemma is defining the parts of the partition P that will contain not just each vertex, but also each pair of vertices, each triple of vertices, and so on up to each r−1-tuple of vertices. We need to ensure that these choices are consistent: if A⊆B are two sets of vertices, we need to make sure that the part of P(∣A∣) containing A is in the polyad of the part of P(∣B∣) containing B.
Given an r-graph F, we denote by F<i> the set of i-tuples of vertices which are contained in some edge of F. In particular, F<1>=V(F) and F<r>=E(F).
Theorem 18** (Counting lemma).**
For every 1≤r≤ℓ, every r-uniform hypergraph F on vertex set [ℓ], for all dr there exists ξr such that for all ar−1, there exists ξr−1 such that for all ar−2 there exists ξr−2 … such that for all a2 there exist ξ2,β and m0 such that the following holds:
Let H be an r-uniform hypergraph, with a (r−1,a)-nested, (1,ξ,a,β)-equitable family of partitions P, where the size of each part of P(1) is at least m0. For each 1≤i≤r−1, let fi:F<i>→P(i) be a function, as well as fr:E(F)→P^(r−1). Suppose that the following conditions hold:
•
For every 2≤i≤r−1, for every S∈F<i>, we have that P^(i−1)(fi(S))=∪v∈Sfi−1(S−v).
•
For every e∈E(F), we have fr(e)=∪v∈efr−1(e−v).
•
For every e∈E(H), the hypergraph H is (d,ξr,β)-regular w.r.t. fr(e), for some d≥dr.
Then H contains F as a subgraph.
Before starting with the proof, let us mention that, while we will only need the existence version of the hypergraph counting lemma, we will use the more precise version of the graph counting lemma, which we now state.
Lemma 19**.**
Let k be a positive integer. For every ε>0 there exists ξ>0 with the following property. Let G be a graph and let V1,V2,…,Vk be disjoint vertex subsets of size n. Let S be the set of k-cliques in G with one vertex in each Vi. If for every 1≤i<j≤k the bipartite graph induced on (Vi,Vj) is (d,ξ)-regular, then ∣S∣−d(2k)nk≤εnk.
7 Proof of density theorems
7.1 Overview of the proofs
The proofs of Theorems 10 and 11 follow a similar outline. In order to prove the lower bounds on π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F), we will construct a locally 1/4-dense sequence of hypergraphs Hn in which no pair of vertices is the head of some edge and the tail of another, or a locally πr-dense sequence Hn where every pair of edges intersecting in two vertices admits a consistent descriptive sequence. In either case, F cannot be a subgraph of Hn.
Let Hn be a locally (1/4+ε)-dense or (πr+ε)-dense sequence of hypergraphs, respectively. Our goal is to show that Hn contains F as a subgraph.
Step 1: Apply the hypergraph regularity lemma to some large enough hypergraph H in the sequence to obtain a regular family of partitions P. Denote the parts in P(1) as V1,…,Vq.
Step 2: Remove from H all edges contained in polyads over which H is not regular or where the density of H w.r.t. the polyad is less than ε/100, and let H′ be the result. This guarantees that not too many edges are removed, and in particular only a tiny proportion of r-tuples of parts have decreased their density by more than ε/50. There exists a subset of q1 parts, w.l.o.g. V1,…,Vq1, such that in every r-tuple of them the density of H∖H′ is at most ε/50. Restrict H′ and P to these parts.
Step 3: There cannot be a large collection of vertex classes where the density of every r-tuple among them is less than 1/4+2ε/3 or πr+2ε/3, otherwise H would not have the required local density. By Ramsey’s theorem, there exists a subset of q2 vertex sets, w.l.o.g. V1,…,Vq2, in which every r-tuple of them has density at least 1/4+2ε/3 or πr+2ε/3 in H, and density at least 1/4+ε/2 or πr+ε/2 in H′.
Step 4: Define an auxiliary (q2,r)-reduced hypergraph R, where each vertex represents one part of P(2), and where an (2r)-tuple of vertices forms an edge if they form the second polyad of an edge e in H′. Then R has density at least 1/4+ε/4 or πr+ε/4, respectively.
Step 5: Use Lemma 14 or Lemma 15 to find a subset of ℓ=∣V(F)∣ indices where every 2r−2-tuple of indices in R admits some descriptive sequence σ=(s1,s2,…,s2r−2). In the case of Lemma 14 this sequence is XX…XZZYY…Y, while in the case of Lemma 15σ is some inconsistent descriptive sequence. In either case, F admits this descriptive sequence.
Step 6: Take a function f1 that assigns one remaining part of P(1) to each vertex of F, in an order that is consistent with the descriptive sequence σ. For every twin pair of edges e,e′, consider the image under f1 of their 2r−2 vertices. Consider edges ge,ge′ of R which certify that the corresponding 2r−2-tuple of indices admits the descriptive sequence σ. Let he,he′ be edges in H′ corresponding to ge,ge′. Use these edges to construct the functions f2,f3,f4,…,fr from the statement of the counting lemma, and apply the lemma to conclude the existence of a copy of F in H.
Fix a quasi-linear, head-tail-mixing r-graph F, which admits the descriptive sequence XX…XZZYY…Y. We will start by showing that πu(F)≥1/4. To do this we will show that there exists a sequence of hypergraphs Hn which is locally 1/4-dense and which does not contain F as a subgraph.
Take [n] as the vertex set of Hn. Start by randomly coloring each pair of vertices in the colors red and blue. Then, for each r-tuple of vertices v1<v2<⋯<vr, we place an edge of Hn there if the pair v1v2 (that is, the head) is red and the pair vr−1vr (the tail) is blue. It is clear that there is no pair of vertices that is both the head of some edge of Hn and the tail of another, and as such Hn cannot contain a head-tail-mixing hypergraph like F as its subgraph.
To complete the upper bound, fix δ>0. We will show that, with high probability, the hypergraph Hn is (1/4,δ,\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture)-dense, by showing that the probability that a subset S of δn vertices has density less than 1/4−δ is o(2−n). As the pair coloring is random, the probability that each individual r-tuple becomes an edge of Hn is 1/4. Moreover, given a family of r-tuples in which no pair of them shares two vertices, the events in which each r-tuple becomes an edge of Hn are independent.
By a theorem of Rödl [18], for n large enough it is possible to find (δn)2/(2r2)r-tuples of vertices in S which pairwise intersect in at most one vertex. Let L be such a family, sampled uniformly at random. Let E be the event in which less than a 1/4−δ/2 proportion of the r-tuples of L become edges of Hn. On the one hand, if we first fix L and then run the random coloring of pairs of vertices, by Chernoff’s bound the probability of E is at most 2−O(n2). On the other hand, suppose that the coloring procedure is run first. Let P be the event in which S has density lower than 1/4−δ. Conditioned on P, the expected proportion of r-tuples of L which become edges of Hn is at most 1/4−δ, since by symmetry each r-tuple has the same probability of being included in S. By Markov’s inequality, the probability of E conditioned on P is at least 1−1/4−δ/21/4−δ≥δ. Thus
[TABLE]
This concludes the proof of the upper bound π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)≥1/4.
Next we will show that π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)≤1/4. Let ℓ=∣V(F)∣. Fix ε>0, and let {Hn}n=1∞ be a locally (1/4+ε)-dense sequence of r-graphs. Our goal is to show that F is a subgraph of Hn for some n.
There will be several parameters involved in this proof. Describing them as a hierarchy is complicated by the fact that several inputs of the hypergraph regularity lemma are functions rather than constants. Among the ones that do behave like constants, the hierarchy is as follows:
[TABLE]
The specific relation between them, and with the functions ξ2,ξ3,…,ξr−1,β will be described next. Our inputs consist of a value ε>0 and an r-graph F. Let ℓ=∣V(F)∣. Let q2 be the value of k obtained from Lemma 14, with inputs ε/4, r and ℓ. Let μ=⌈4rr/ε⌉, and q1 be the Ramsey number Rr(max{q2,μ},2). Let ξr=100q1rε. We set dr=ε/100, and then on Theorem 18 with inputs r,ℓ,dr we obtain a function ξr−1=ξr−1(ar−1), then a function ξr−2=ξr−2(ar−1,ar−2), and so on, until we obtain functions ξ3=ξ3(ar−1,ar−2,…,a3), and then ξ2′,β,m0=ξ2′,β,m0(ar−1,ar−2,…,a2), where ξ2′ is the value ξ2 from Theorem 18 (we rename it because it will not match the one used as an input in Theorem 17). Let ξ2′′(ar−1,ar−2,…,a2) be the value of δ obtained from Lemma 19 on parameters r and ε/(4a2(2r)). Let ξ2=min{ξ2′,ξ2′′}. Next we apply Theorem 17 with parameters r,1/q1,ξr,β,ξ2,ξ3,…,ξr−1 to obtain t and n0. Finally we take M=max{m0(a):a∈[t]r−2}, δ=min{1/(2t),ε/100} and N=max{2n0,t!,2tM}. Choose τ such that Hτ has at least N vertices and is (1/4+ε,δ,\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture)-dense.
Let n′ be the number of vertices of Hτ, and let n be the largest multiple of t! less than or equal to n′. Since n′≥N≥t!, we have n≥n′/2. Select a subset of n vertices from Hτ, and let H be the hypergraph induced by Hτ on those vertices. Since Hτ is (1/4+ε,δ,\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture)-dense, H is (1/4+ε,2δ,\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture)-dense.
Since n is at least n0 and is divisible by t!, we can use the regularity lemma on H. Applying Theorem 17 with parameters r,1/q1,ξr,β,ξ2,ξ3,…,ξr−1, we obtain an (r−1,a)-nested family of partitions P, for some vector a, such that
•
P is (1/q1,ξ(a),a,β(a))-equitable and t-bounded, and
•
H is (∗,ξr,β(a))-regular w.r.t. P.
Remove from H all edges e such that H is not (∗,ξr,β(a))-regular over its polyad P^(r−1)(e), or if the density of H over P^(r−1)(e) is less than ε/100, to obtain the hypergraph H′. Let V1,V2,…,Va1 be the classes of the partition P(1), and let z=n/a1 be the size of each set Vi.
We claim that the number of r-tuples of parts Vi1,Vi2,…,Vir such that H∖H′ has edge density at least ε/50 on the r-partite graph between them is less than (ra1)/(rq1). Indeed, within each r-tuple of parts the number of edges removed because they belong to sparse polyads is at most εzr/100, so to reach density ε/50 in H∖H′ we need to have at least εzr/100 edges in irregular polyads. Since H is (∗,ξr,β(a))-regular over P, there are at most ξrnr=ξra1rzr edges of H belonging to irregular polyads. The number of r-tuples of parts containing at least εzr/100 of these edges is at most ξra1rzr/(εzr/100)=(a1/q1)r<(ra1)/(rq1).
Select a set I1⊆[a1] of size q1 uniformly at random (we know that a1≥q1 because P is (1/q1,ξ(a),a,β(a))-equitable, where the first parameter means that ∣Crossr(P(1))∣≥(rn)/q1, which is impossible if P(1) has fewer than q1 parts). The expected number of r-tuples i1,i2,…,ir in I1 such that H∖H′ has edge-density at least ε/100 on the corresponding parts Vi is less than 1, therefore there exists a set I1 of size q1 in which the density of H∖H′ in each corresponding r-tuple of parts is less than ε/100. W.l.o.g., we can assume that I1=[q1].
Consider an auxiliary complete r-graph on the vertex set [q1]. We color an r-tuple of elements in red if the edge density of H in the corresponding r-tuple of parts is at least 1/4+2ε/3, and blue otherwise. Since q1=Rr(max{q2,μ},2), there is either a red clique of size q2 or a blue clique of size μ. We claim that the blue clique is impossible. Indeed, consider the set W formed by the union of the vertex sets Vi with i in this blue clique. Its size is ∣W∣=μz≥z=n/a1≥n/t≥2δn, so from the fact that H is (1/4+ε,2δ,\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture)-dense, and δ≥ε/100, the edge-density of H on the set W is at least 1/4+49ε/50. On the other hand, every r-tuple of parts in W has edge-density at most 1/4+2ε/3, and the number of edges in W with two vertices in the same part is at most μr−1zr. But that means that the number of edges of H in W is at most (1/4+2ε/3)(rμz)+μr−1zr≤(1/4+2ε/3)(rμz)+rr(rμz)/μ<(1/4+49ε/50)(rμz), reaching a contradiction. There exists a red clique of size q2, and let I2⊆I1 be the set of elements in the clique. Within each r-tuple of parts in I2 the density of H is at least 1/4+2ε/3, and the density of H′∖H is at most ε/50, so the density of H′ on each r-tuple is at least 1/4+ε/2. W.l.o.g., we can assume that I2=[q2].
Consider the partition P(2), which partitions Cross2(P(1))⊆(2V(H)). Because P is (r−1,a)-nested, for every pair of parts (Vi,Vj), P(2) partitions the set of pairs of vertices between Vi and Vj into a2 parts. We can think of each such part P=P(2) as a bipartite graph between Vi and Vj. Moreover, since P is (1/q1,ξ(a),a,β(a))-equitable, each bipartite graph P is (1/a2,ξ2(a))-regular, in the sense of Lemma 19.
We will define an auxiliary (q2,r)-reduced graph R. Remember that a (k,r)-reduced graph is ar (2r)-graph whose vertex set is partitioned into (2k) parts Wi,j, with 1≤i<j≤k. Each edge has (2r) vertices, which lie in parts of the form Wi1,i2,Wi1,i3,…,Wir−1,ir, for some 1≤i1<i2<⋯<ir≤k. The constituent Ai1,i2,…,ir is the (2r)-partite (2r)-graph induced by R on the vertex sets Wij,ij′.
Let the vertex sets of R be Wi,j with 1≤i<j≤q2. Each Wi,j will have size a2, and the elements of Wi,j will represent the a2 partition classes P∈P(2) in which the bipartite graph between Vi and Vj gets split by P(2). Let i1,i2,…,ir be an r-tuple of elements of [q2], and for each 1≤j<j′≤r let wj,j′ be a vertex in Wij,ij′, and let Pj,j′ be the corresponding part of P(2). We define the edges of R as follows: the (2r) vertices w1,2,w1,3,…,wr−1,r form an edge of R if there exists an edge e∈H′ in which each pair of vertices belongs to one of the classes P1,2,P1,3,…,Pr−1,r.
Consider the constituent A1,2,…,r. Every edge of e∈H′ with one vertex in each of V1,V2,…,Vr generates in R an edge, which we will denote by R(e), whose (2r) vertices correspond to the parts of P(2) containing each pair of vertices in e. There are at least (1/4+ε/2)zr edges in H′ between V1,V2,…,Vr. To bound the number of edges in A1,2,…,r, we will bound how many edges in H′ can generate the same edge of R.
Let w1,2,w1,3,…,wr−1,r be vertices, with wi,j∈Wi,j, and let Pi,j be the part of P(2) corresponding to wi,j. Treating each Pi,j as a bipartite graph, each edge e∈H′ with R(e)=w1,2w1,3…wr−1,r corresponds to an r-clique in the r-partite graph formed by the union of the graphs Pi,j. Because each Pi,j is (1/a2,ξ2(a)), and ξ2(a)≤ξ2′′(a), we can apply the graph counting lemma. By Lemma 19 with parameters r and ε/(4a2(2r)), the number of r-cliques in the union of the graphs Pi,j is at most zr/a2(2r)+εzr/(4a2(2r))=(1+ε/4)zr/a2(2r).
Because H has at least (1/4+ε/2)zr edges between the sets V1,V2,…,Vr, and each edge of the constituent A1,2,…,r corresponds to at most (1+ε/4)zr/a2(2r) of those edges, the number of edges in A1,2,…,r is at least (1/4+ε/2)a2(2r)/(1+ε/4)≥(1/4+ε/4)a2(2r). In other words, the constituent has edge density at least 1/4+ε/4. The same holds true for all other constituents, so the (q2,r)-reduced graph R is (1/4+ε/4)-dense.
By the choice of q2, by Lemma 14 there exists a set I3 of ℓ indices in I2=[q2] such that every 2r−2-tuple of indices in I3 admits the descriptive sequence XX…XZZYY…Y. W.l.o.g., we can assume that I3=[ℓ]. The hypergraph F admits XX…XZZYY…Y, so there exists an order v1,v2,…,vℓ of its vertex set in which XX…XZZYY…Y describes every pair of edges with intersection size two. To conclude the proof of Theorem 10, our goal is to use the hypergraph counting lemma (Theorem 18) to prove that H contains F as a subgraph.
F is quasi-linear, meaning that non-twin pairs of edges intersect in at most one vertex. Any twin pair of edges e,e′ has the form e=vi1,vi2,…,vir and e′=vir−1,vir,…,vi2r−2, with i1≤i2≤⋯≤i2r−2. The set of 2r−2 indices {i1,…,i2r−2} admits the descriptive sequence XX…XZZYY…Y, so in R there exist edges ge∈Ai1,i2,…,ir and ge′∈Air−1,ir,…,i2r−2 which intersect in one vertex wir−1,ir∈Wir−1,ir. There exist edges he,he′∈H′ such that R(he)=ge and R(he′)=ge′. Each vertex vij in e corresponds to a vertex in he or he, namely the one contained in Vij. Note that he and he′ each have one vertex in each of Vir−1 and Vir, and both pairs of vertices belong to the same class of P(2), the one corresponding to wir−1,ir.
We are now ready to define the functions fi:F<i>→P(i) with 1≤i≤r−1 from Theorem 18. For any i-tuple of vertices S in F<i>, choose an edge e containing these vertices. Then fi(S) is the part of P(i) containing the corresponding i vertices in he. We define fr(e)=P^(r−1)(he) for each e∈E(F).
We begin by observing that the functions fi are all well-defined. The image of each vertex vi is the part Vi. If a pair of vertices vi,vj is contained in two edges e,e′, then e and e′ must form a twin pair, in which case the part of P(2) containing the corresponding pair of vertices in he and he′ is the same. There is no set of three or more vertices contained in more than one edge. In addition, if 2≤i≤r−1, and S is a set of i vertices, we have that the (i−1)-th polyad of fi(S) is precisely ∪v∈Sfi−1(S−v), and we also have fr(e)=P^(r−1)(he)=∪v∈eP(r−1)(e−v)=∪v∈efr−1(e−v) for all e∈E(F). Finally, because each he belongs to H′, and in particular it was not removed from H when creating H′, it means that H is (d,ξr,β(a))-regular w.r.t. fr(e) for some d≥ε/100. Observe also that the size of each vertex set Vi is at least m0(a), because z=n/a1≥n′/2a1≥N/2t≥M≥m0(a). We can apply Theorem 18 to deduce that H contains F as a subgraph, and so does Hτ, as we wanted to show. That completes the proof of Theorem 10.
Let F be a quasi-linear, inconsistent r-graph which admits all inconsistent descriptive sequences of order r. We will start by showing that π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)≥πr, by constructing a locally πr-dense sequence of r-graphs {Hn}n=1∞ which are F-free. We will take [n] as the vertex set of Hn. Let φn:(2[n])→(2[r]) be a random function, i.e., a uniformly random coloring of the pairs of vertices of Hn with the set of colors (2[r]). The edges of Hn will be precisely the r-tuples of vertices 1≤v1<v2<⋯<vr≤n satisfying that φn({vi,vj})={i,j} for all 1≤i<j≤n.
For each δ>0 we will first show that, with high probability, Hn is (πr,δ,\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture)-dense. Let S be a set of δn vertices from [n]. We will show that S has edge-density at least πr−δ with probability 1−o(2−n).
By a theorem of Rödl [18], for n large enough it is possible to find (δn)2/(2r2)r-tuples of vertices in S pairwise intersecting in at most one vertex. Let L be such a family, sampled uniformly at random. For each individual edge e in L, the probability that φn induces on e the unique coloring that makes e an edge of Hn is (2r)−(2r)=πr, and the events are mutually independent among the edges of L. Let E be the event that fewer than (πr−δ/2)∣L∣ elements of L become edges of Hn. By Chernoff’s bound, the probability of E is at most 2−O(n2). On the other hand, suppose that φn is sampled first, and L is sampled later. Let P be the event that S has edge-density lower than πr−δ. By symmetry, each r-tuple of vertices in S is included in L with equal probability, so by linearity of expectation, the expected proportion of elements of L which are edges of Hn equals the edge-density of S. By Markov’s inequality, the probability of E conditioned on P is at least 1−πr−δ/2πr−δ. Thus
[TABLE]
On the other hand, we can show that F is not a subgraph of Hn for any n. Indeed, suppose that there is a copy of F in Hn, and consider the vertex-order ⪯ of V(F) induced by the natural order of V(Hn)=[n]. Since F is inconsistent, the order ⪯ is not a consistent order in F, and there exists a twin pair of edges e,e′ such that e∩e′ plays different roles in e and e′. On the other hand, let u and v be the vertices of Hn corresponding to e∩e′. By construction of Hn, if φn(u,v)={i,j}, then the pair {u,v} plays the role {i,j} in all the edges containing both u and v, yielding a contradiction. We conclude that the sequence {Hn}n=1∞ is F-free. This proves that π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)≥πr.
The proof of the upper bound π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)≤πr is analogous to that of Theorem 10. The main difference is that, once we construct the (q2,r)-reduced graph R, we apply Lemma 15 rather than Lemma 14. We obtain a collection I3 of ℓ indices and an inconsistent descriptive sequence σ=(s1,s2,…,s2r−2) such that all 2r−2-tuples from I3 admit σ. Since F admits all inconsistent descriptive sequences, in particular σ, there exists an order v1,v2,…,vℓ of V(F) in which every twin pair of edges of F is described by σ. From this point, we can finish as in the proof of Theorem 10.
8 Concluding remarks
In [16], Reiher, Rödl and Schacht characterized the 3-graphs F with π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=0. Their characterization can be described as follows: there exists an ordering ⪯ of V(F), and a function φ:(2V(F))→(2[3]) such that every pair of vertices u,v plays the role φ(uv) in every edge containing both u and v.
A consequence of this characterization is that every 3-graph F has either π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=0 or π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)≥1/27. To see this, consider a random function φn:(2[n])→(2[3]), and let Hn be the 3-graph on vertex set [n] where the edges are the triples 1≤u<v<w≤n with φn(uv)={1,2}, φn(uw)={1,3} and φn(vw)={2,3} (this is the construction from the lower bound of Theorem 11 in the particular case r=3). We showed that with high probability this sequence is locally 1/27-dense. If F does not appear as a subgraph of any Hn, then by definition π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)≥1/27, whereas if F appears as a subgraph, then F satisfies the property from the characterization, so π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=0. Together with the construction of a 3-graph F with π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=1/27 found in [7], we conclude that 1/27 is the minimum positive value of the uniform Turán density of 3-graphs.
We conjecture that a similar characterization holds for r-graphs for general r.
Conjecture 20**.**
Let F be an r-graph. Then π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=0 if and only if there exists an ordering ⪯ on V(F) and a function φ:(2V(F))→(2[r]) with the property that, for each pair of vertices u,v and every edge e containing u and v, the pair {u,v} plays the role φ(uv) in e.
If Conjecture 20 holds, then every r-graph with π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)>0 satisfies π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)≥πr. Indeed, we can construct a locally πr-dense sequence of r-graphs as in the proof of the upper bound of Theorem 11, and once again any F which appears as a subgraph satisfies π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)=0. Therefore, Theorem 3 implies that πr is the minimum positive value for the uniform Turán density of r-graphs.
More ambitiously, one could aim to prove an analogue of the main result of [11]: the uniform Turán density of an r-graph F is the supremum of the densities of the generalized palette constructions not containing F as a subgraph. For simplicity, we will focus on the case in which the edges of F pairwise intersect in at most two vertices.
Let C be a finite set, whose elements we will call colors, and let A⊆C(2r) be a set, whose elements we call admissible patterns. We call the pair P=(C,A) a palette, and its density is d(P)=∣A∣/∣C∣(2r). We can use the palette P to generate a random r-graph Hn on the vertex set [n] as follows. Take a random C-coloring of the graph Kn, that is, a uniformly random function φ:(2[n])→C. For every r-tuple of vertices 1≤v1<v2<⋯<vr≤n, these vertices form an edge of Hn iff (φ(v1v2),φ(v1v3),…,φ(vr−1vr))∈A.
Using standard concentration inequalities, one can show that with high probability the generated sequence {Hn}n=1∞ is locally d(P)-dense. Therefore, if F is not contained in any hypergraph in the sequence, we have π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F)≥d(P). Notice that the lower bound constructions from Theorem 10 and Theorem 11 are particular cases of palettes. In the former case we can take C={red,blue} and A contains the 2(2r)−2 vectors whose first entry is red and whose last entry is blue. In the latter case we have C=(2[r]) and A only contains the admissible pattern {{1,2},{1,3},…,{r−1,r}}.
One can hope to prove that for every r-graph F where edges intersect pairwise in at most two vertices, π\leavevmodeto5.39pt\vboxto4.26pt\pgfpicture\makeatletter\lower-5.54253ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.98999pt-4.55254pt\pgfsys@curveto0.98999pt-4.00578pt0.54675pt-3.56255pt0.0pt-3.56255pt\pgfsys@curveto-0.54675pt-3.56255pt-0.98999pt-4.00578pt-0.98999pt-4.55254pt\pgfsys@curveto-0.98999pt-5.09929pt-0.54675pt-5.54253pt0.0pt-5.54253pt\pgfsys@curveto0.54675pt-5.54253pt0.98999pt-5.09929pt0.98999pt-4.55254pt\pgfsys@closepath\pgfsys@moveto0.0pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.00.0pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto4.40439pt-4.55254pt\pgfsys@curveto4.40439pt-4.00578pt3.96115pt-3.56255pt3.4144pt-3.56255pt\pgfsys@curveto2.86765pt-3.56255pt2.42441pt-4.00578pt2.42441pt-4.55254pt\pgfsys@curveto2.42441pt-5.09929pt2.86765pt-5.54253pt3.4144pt-5.54253pt\pgfsys@curveto3.96115pt-5.54253pt4.40439pt-5.09929pt4.40439pt-4.55254pt\pgfsys@closepath\pgfsys@moveto3.4144pt-4.55254pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.03.4144pt-4.55254pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto2.69719pt-2.27626pt\pgfsys@curveto2.69719pt-1.7295pt2.25395pt-1.28627pt1.7072pt-1.28627pt\pgfsys@curveto1.16045pt-1.28627pt0.71721pt-1.7295pt0.71721pt-2.27626pt\pgfsys@curveto0.71721pt-2.82301pt1.16045pt-3.26625pt1.7072pt-3.26625pt\pgfsys@curveto2.25395pt-3.26625pt2.69719pt-2.82301pt2.69719pt-2.27626pt\pgfsys@closepath\pgfsys@moveto1.7072pt-2.27626pt\pgfsys@fill\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.7072pt-2.27626pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\pgfsys@invoke\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\pgfsys@endscope\hss\endpgfpicture(F) is the supremum of the densities of palettes such that the randomly generated sequence Hn does not contain F as a subgraph. However, for any r≥4, attempting to mirror the proof from [11] fails at a crucial step.
Let P=(C,A) be a palette, and let k≥r be a positive integer. We define the k-blowup of P, denoted by P[k], as the following (k,r)-reduced hypergraph. Each vertex set Vi,j with 1≤i<j≤k is a copy of C. We denote the copy of the color c∈C in Vi,j as ci,j. For each 1≤t1<t2<⋯<tr≤k, the constituent At1,t2,…,tr has exactly ∣A∣ edges: for each (c1,2,c1,3,…,cr−1,r)∈A, the constituent contains the edge (c1,2)t1,t2(c1,3)t1t3⋯(cr−1,r)tr−1,tr. The (k,r)-reduced graph P[k] is d(P)-dense.
Given a (k,r)-reduced graph H on vertex sets Vi,j and a (k′,r)-reduced graph H′ on vertex sets Wi,j, a homomorphism from H to H′ is a pair (φ,f), where φ is a function φ:V(H)→V(H′) that maps edges to edges, and f is a function f:[k]→[k′] such that if v∈Vi,j then φ(v)∈Wf(i),f(j). The following (implicit) lemma is the basis of the main result from [11]:
Lemma 21**.**
For every ε>0 and every m there exists k with the following property: every d-dense (k,3)-reduced graph admits a homomorphism from P[m], for some palette P with d(P)≥d−ϵ.
The same lemma is false for (k,4)-reduced graphs: for every k, there exists a 1/4-dense (k,4)-reduced graph H which does not contain the 17-blowup of any palette with positive density. Let each Vi,j be a copy of 2[k]. For every S⊆[k], we denote the copy of S in Vi,j as Si,j. For every 1≤t1<t2<t3<t4≤k,
[TABLE]
H is 1/4-dense because for any t1<t2<t3<t4 exactly one quarter of the sets in 2[k] contain t3 but not t4. On the other hand, it is possible to show that H does not contain P[17] for any palette P such that A is non-empty, using the fact that by the Erdős-Szekeres theorem, the function f in any homomorphism is monotone on a sequence of five indices. Examples like this are a natural obstacle to characterizing uniform Turán density in terms of palettes for r-graphs with r≥4.
More generally, if the edges of F are allowed to have arbitrary intersections, palettes should be modified to also color triples of vertices, quadruples of vertices, and so on up until (r−1)-tuples of vertices. In order to decide whether an r-tuple of vertices in n is an edge of Hn or not, we should consider the color pattern of its pairs of vertices, its triples, and so on up until (r−1)-tuples of vertices. In this case, A⊆C2r−r−2, where 2r−r−2=∑i=2r−1(ir). If it holds that the uniform Turán density of an r-graph F is the supremum of the densities of palette constructions that do not contain F as a subgraph, then Conjecture 20 would follow.
Acknowledgments
The author would like to thank Frederik Garbe, Daniel Il’kovič, Dan Král’ and Filip Kučerák for helpful discussions on the topic, and Hong Liu for his comments on an early version of this paper.
Bibliography22
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] I. Bárány and P. Valtr. A positive fraction Erdős-Szekeres theorem. Discrete and Computational Geometry , 19:335–342, 1998.
2[2] M. Bucić, J. W. Cooper, D. Král’, S. Mohr, and D. Munhá Correia. Uniform turán density of cycles. Transactions of the American Mathematical Society , 376(7):4765–4809, 2023.
3[3] P. Erdős and A. Hajnal. On Ramsey like theorems. Problems and results. Combinatorics (Proc. Conf. Combinatorial Math., Math. Inst.,) , pages 123–140, 1972.
4[4] P. Erdős and V. T. Sós. On Ramsey-Turán type theorems for hypergraphs. Combinatorica , 2(3):289–295, 1982.
5[5] P. Erdős and A. H. Stone. On the structure of linear graphs. Bulletin of the American Mathematical Society , 52(12):1087–1091, 1946.
6[6] P. C. Fishburn and R. L. Graham. Lexicographic ramsey theory. Journal of Combinatorial Theory, Series A , 62:280–298, 1993.
7[7] F. Garbe, D. Král’, and A. Lamaison. Hypergraphs with minimum positive uniform Turán density. Israel Journal of Mathematics , 259(2):701–726, 2024.
8[8] R. Glebov, J. Volec, and D. Král’. A problem of Erdős and Sós on 3-graphs. Israel Journal of Mathematics , 211(1):349–366, 2016.