Speaker: Jun Wang(Shanghai Normal University)

　　Title: Combinatorics of finite sets II: Erdos-Ko-Rado theorem

　　Time & Venue: 2021.10.15 9:00-10:30

　　Tencent Meeting ID：486 5815 4916 Meeting Passport：314159

　　Abstract: An intersecting family of sets is a collection of sets such that every two sets intersect.  The Erdos-Ko-Rado theorem describes the size and structure of largest intersecting families of k-subsets of an n-set where n> 2k. This is another central result of combinatorics which opened the way for the rapid development of extremal set theory, as said by Frankl and Graham. In this talk, we shall present its brief history, thoughts, problems and conjectures.