Title: Maximum Independent Sets in Erdos-Ko-Rado Combinatorics
|Affiliation:||University of Waterloo|
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.
200 University Avenue West
Waterloo, ON N2L 3G1