English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A $k$-graph (or $k$-uniform hypergraph) $H$ is uniformly dense if the edgedistribution of $H$ is uniformly dense with respect to every large collectionof $k$-vertex cliques induced by sets of $(k-2)$-tuples. Reiher, R\"odl andSchacht [Int. Math. Res. Not., 2018] proposed the study of the uniform Tur\'andensity $\pi_{k-2}(F)$ for given $k$-graphs $F$ in uniformly dense $k$-graphs.Meanwhile, they [J. London Math. Soc., 2018] characterized $k$-graphs $F$satisfying $\pi_{k-2}(F)=0$ and showed that $\pi_{k-2}(\cdot)$ ``jumps" from 0to at least $k^{-k}$. In particular, they asked whether there exist $3$-graphs$F$ with $\pi_{1}(F)$ equal or arbitrarily close to $1/27$. Recently, Garbe,Kr\'al' and Lamaison [arXiv:2105.09883] constructed some $3$-graphs with$\pi_{1}(F)=1/27$.  In this paper, for any $k$-graph $F$, we give a lower bound of $\pi_{k-2}(F)$based on a probabilistic framework, and provide a general theorem that reducesproving an upper bound on $\pi_{k-2}(F)$ to embedding $F$ in reduced $k$-graphsof the same density using the regularity method for $k$-graphs. By using thisresult and Ramsey theorem for multicolored hypergraphs, we extend the resultsof Garbe, Kr\'al' and Lamaison to $k\ge 3$. In other words, we give asufficient condition for $k$-graphs $F$ satisfying $\pi_{k-2}(F)=k^{-k}$.Additionally, we also construct an infinite family of $k$-graphs with$\pi_{k-2}(F)=k^{-k}$.

The minimum positive uniform Tur\'an density in uniformly dense $k$-uniform hypergraphs