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

doi:10.1016/j.procs.2021.11.050

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

Mathematics

Research output: Contribution to journal › Article

59 Downloads (Pure)

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.

Original language	English
Pages (from-to)	412-418
Journal	Procedia Computer Science
Volume	195
DOIs	https://doi.org/10.1016/j.procs.2021.11.050
Publication status	Published - 5 Jan 2022

Keywords

Hypergraphs
Turán’s problem
extremal graph theory
quasirandomness

Access to Document

10.1016/j.procs.2021.11.050Licence: Creative Commons: Attribution-NonCommercial-NoDerivs (CC BY-NC-ND)

BergerS2021TuránFinal published version, 377 KBLicence: Creative Commons: Attribution-NonCommercial-NoDerivs (CC BY-NC-ND)

Cite this

@article{00b2455ada304d2aabdb8e2c9ccbcd21,

title = "Tur{\'a}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.",

keywords = "Hypergraphs, Tur{\'a}n{\textquoteright}s problem, extremal graph theory, quasirandomness",

author = "S{\"o}ren Berger and Simon Piga and Christian Reiher and Vojt{\v e}ch R{\"o}dl and Mathias Schacht",

year = "2022",

month = jan,

day = "5",

doi = "10.1016/j.procs.2021.11.050",

language = "English",

volume = "195",

pages = "412--418",

journal = "Procedia Computer Science",

issn = "1877-0509",

publisher = "Elsevier",

}

TY - JOUR

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

AU - Berger, Sören

AU - Piga, Simon

AU - Reiher, Christian

AU - Rödl, Vojtěch

AU - Schacht, Mathias

PY - 2022/1/5

Y1 - 2022/1/5

N2 - 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.

AB - 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.

KW - Hypergraphs

KW - Turán’s problem

KW - extremal graph theory

KW - quasirandomness

UR - http://www.scopus.com/inward/record.url?scp=85122950478&partnerID=8YFLogxK

U2 - 10.1016/j.procs.2021.11.050

DO - 10.1016/j.procs.2021.11.050

M3 - Article

SN - 1877-0509

VL - 195

SP - 412

EP - 418

JO - Procedia Computer Science

JF - Procedia Computer Science

ER -

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

Abstract

Keywords

Access to Document

Fingerprint

Cite this