2 problems

Palette conjecture. Every lower bound for a uniform Turán density should be obtained by a palette construction; equivalently, every such lower bound should arise from the palette L…

Let $F$ be a $k$-graph. For integers $1\leq\ell\leq k-3$, let $\pi_{\rm u}^{(\ell)}(F)$ denote its $\ell$-uniform Turán density. An $(\ell+1)$-vanishing order is an ordering of…