Turán density of cliques of order five in $3$-uniform hypergraphs with quasirandom links

Abstract

We show that $3$-uniform hypergraphs with the property that all vertices have a quasirandom link graph with density bigger than $1/3$ contain a clique on five vertices. This result is asymptotically best possible.

arXiv commentsecond version addresses referee reports