Title   name
2017 Discrete Math 세미나
  Speaker   Brendan Rooney    
  Date 2017-04-24
  Place KAIST
  File  의 1 번째 Real Media 동영상입니다.
Abstract : The Erdos-Ko-Rado Theorem is a classic result about intersecting families of sets. More recently, analogous “EKR-type” type theorems have been developed for other types of objects. For example, non-trivially intersecting vector spaces, and overlapping strings. In this seminar we will give a proof of the EKR Theorem for permutations in Sn due to Godsil and Meagher. Along the way we will see some useful tools from algebraic graph theory. Namely, a bound on the maximum size of an independent set in a graph, equitable partitions, and eigenpolytopes.