Title | ||
---|---|---|
Turan 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. (C) 2021 The Authors. Published by Elsevier B.V. |
Year | DOI | Venue |
---|---|---|
2021 | 10.1016/j.procs.2021.11.050 | PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM |
Keywords | DocType | Volume |
Hypergraphs, extremal graph theory, Turan's problem, quasirandomness | Conference | 195 |
ISSN | Citations | PageRank |
1877-0509 | 0 | 0.34 |
References | Authors | |
0 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sören Berger | 1 | 0 | 0.34 |
Simón Piga | 2 | 0 | 1.01 |
Christian Reiher | 3 | 3 | 4.49 |
Vojtech Rödl | 4 | 0 | 0.34 |
Mathias Schacht | 5 | 0 | 0.68 |