Events by date

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. 

Title: Some problems on the size Ramsey numbers

Speaker: Gholam Reza Omidi Affiliation: Isfahan University of Technology Room: MC 5417

Abstract: For given simple graphs $G_1$ and $G_2$, the size Ramsey number $\hat{R}(G_1,G_2)$ is the smallest positive integer $m$,