|Title: Quasirandomness and hypergraph regularity|
|Speaker: Mathias Schacht of The University of Hamburg and Yale University|
|Contact: Dwight Duffus, email@example.com|
|Date: 2019-10-04 at 4:00PM|
|Venue: MSC W301|
The regularity method was pioneered by Szemeredi for graphs and is an important tool in extremal combinatorics. Over the last two decades, several extensions to hypergraphs were developed which were based on seemingly different notions of quasirandom hypergraphs. We show that the concepts behind these approaches are essentially equivalent. This joint work with B. Nagle and V. Rodl.
See All Seminars