Given a family of $3$-graphs $\mathcal{ F}$, the uniform Tur\'{ a}n density $\pi_{ \therefore}(\mathcal{ F})$ is defined as the infimum $d\in[0,1]$ for which any sufficiently large uniformly $d$-dense $3$-graph - that is, a $3$-graph which has edge-density at least $d$ on all linearly sized subsets - contains a copy of some $F \in \mathcal{ F}$. Let $\Pi_{ \therefore,\text{ fin}}$ denote the set of all possible uniform Tur\'{ a}n densities of finite families. Erd\H{ o}s, Hajnal, and R\"{ o}dl introduced a family of constructions for lower bounds on uniform Tur\'an densities called palette constructions. We show that $\Pi_{ \therefore,\text{ fin}}$ contains every $d$ that is obtained as the uniform density of an optimized palette construction. A corollary of this is that $\Pi_{ \therefore,\text{ fin}}$ contains the set of Lagrangians of $3$-graphs and includes irrational numbers. Our work complements a recent result of Lamaison, which states that every value in $\Pi_{ \therefore,\text{ fin}}$ can be approximated by uniform densities of palette constructions.

Categories: math.CO

On possible uniform Tur\'an densities