Spread approximations and intersection problems
Organizer
Benjamin Sudakov
Speaker
Andrey Kupavskii
Time
Tuesday, May 20, 2025 5:05 PM - 6:15 PM
Venue
Online
Online
Zoom 787 662 9899
(BIMSA)
Abstract
We discuss recent progress on different intersection questions for different collections of objects, which was obtained using the spread approximation method. The method was introduced by Kupavskii and Zakharov and developed in a series of subsequent works. As an example, we will discuss a recent result on intersecting families of spanning trees by Frankl, Hurlbert, Ihringer, Kupavskii, Lindzey, Meagher, and Raghu Tej Pantangi. We will also discuss some further ideas and tools that were introduced to the method in the works of Kupavskii on t-intersecting families of permutations and the work of Kupavskii and Noskov on forbidden sunflowers.
Speaker Intro
Andrey Kupavskii, 35 years old, head of the Laboratory of Combinatorial and Geometric structures and Laboratory of Discrete and Geometric Structures at MIPT. Some previous positions: postdoc at EPFL, Oxford, IAS Princeton.