Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a lecture on spread approximation methods and their applications to intersection problems in combinatorics. Andrey Kupavskii, head of the Laboratory of Combinatorial and Geometric Structures at MIPT, presents recent advances in addressing intersection questions for various collections of objects. The talk covers the spread approximation method introduced by Kupavskii and Zakharov, with specific focus on recent results concerning intersecting families of spanning trees. Additional topics include t-intersecting families of permutations and forbidden sunflowers, demonstrating how these mathematical tools have evolved through collaborative research. This one-hour lecture provides insights into cutting-edge combinatorial techniques that have applications across discrete mathematics.
