MATH Seminar

Title: Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links, Part 2
Seminar: Combinatorics
Speaker: Mathias Schacht of The University of Hamburg and Yale University
Contact: Dwight Duffus, dwightduffus@emory.edu
Date: 2021-10-08 at 3:00PM
Venue: MSC E408
Download Flyer
Abstract:
We continue with the proof 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 time we focus on the structure of holes in reduced hypergraphs, which leads to a restricted problem that is easier to solve.

See All Seminars