The uniform Turán density of a hypergraph , introduced by Erdős and Sós, is the smallest value of such that any hypergraph where all linear-sized subsets of vertices of have density greater than contains as a subgraph. Over the past few years the value of was determined for several classes of 3-graphs, but no nonzero value of has been found for -graphs with . In this talk we show the existence of -graphs with , which we conjecture is minimum possible. Joint work with Frederik Garbe, Daniel Il’kovic, Dan Král’ and Filip Kučerák.