You are now in the main content area
Seminar: Applications of Hypergraph Containers
- Date
- January 22, 2020
- Time
- 11:00 AM EST - 12:00 PM EST
- Location
- ENG-210
- Open To
- All Faculty, staff, students and guests are welcome to attend
Recently the breakthrough method of hypergraph containers, developed independently by Balogh, Morris, and Samotij as well as Saxton and Thomason has been used to study sparse random analogues of a variety of classical problems from combinatorics and number theory. This talk will provide an overview of the method including a proof of the graph container theorem and some nice examples. We will also touch on the recent results of Bernshteyn, Delcourt, Towsner, and Tserunyan, including the first known deterministic proof of the containers theorem that is not algorithmic.