MATH Seminar

Title: Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links
Seminar: Combinatorics
Speaker: Mathias Schacht of The University of Hamburg and Yale University
Contact: Dwight Duffus, dwightduffus@emory.edu
Date: 2021-09-17 at 3:00PM
Venue: MSC E408
Download Flyer
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. This is joint work with S. Berger, S. Piga, Chr. Reiher and V. R$\ddot{\mathrm{o}}$dl.

See All Seminars