Thursday, October 25, 2018 1:30 pm
-
1:30 pm
EDT (GMT -04:00)
Title: Maximum Independent Sets in Erdos-Ko-Rado Combinatorics
Speaker: | Nathan Lindzey |
Affiliation: | University of Waterloo |
Room: | MC 6486 |
Abstract: We discuss a general algebraic method for characterizing maximum independent sets in graphs that arise in Erdos-Ko-Rado combinatorics, provided the graphs are large enough.