This is the homepage of the SUSTech Discrete Mathematics Seminar at the Department of Mathematics at SUSTech.
Speaker: Ferdinand Ihringer (SUSTech)
Room: College of Science M1001
Time: 10:00 - 11:00
Tencent Meeting: 128 865 518
In 2017 Gil Kalai asked the speaker about the largest family of $t$-intersecting spanning trees of the complete graph on n vertices. We will discuss these questions: What motivates this problem? Which common techniques for EKR-problems fail? How can we actually solve the problem? Based on joint work with Peter Frankl, Glenn Hurlbert, Andrey Kupavskii, Nathan Lindzey, Karen Meagher, and Venkata Raghu Tej Pantangi.
tags: