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

Link:

https://doi.org/10.1016/j.procs.2021.11.050

Autor/in:

Erscheinungsjahr:

2021

Medientyp:

Text

Schlagworte:

extremal graph theory
Hypergraphs
quasirandomness
Turán's problem

Beschreibung:

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.

Lizenz:

info:eu-repo/semantics/openAccess

Quellsystem:

Forschungsinformationssystem der UHH

Interne Metadaten

Quelldatensatz: oai:www.edit.fis.uni-hamburg.de:publications/8fdf350a-5747-48dd-bd58-7fa1f1b07297