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

Sören Berger, Simon Piga, Christian Reiher, Vojtěch Rödl, Mathias Schacht

Research output: Contribution to journalArticle

13 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)412-418
JournalProcedia Computer Science
Publication statusPublished - 5 Jan 2022


  • Hypergraphs
  • Turán’s problem
  • extremal graph theory
  • quasirandomness

Cite this