Title: Yet Another Proof of the Erdős-Ko-Rado TheoremSpeaker: Nathan Lindzey Affiliation: University of Colorado, Boulder Zoom: Contact Sabrina Lato
We give a short new algebraic proof of the Erdős-Ko-Rado theorem, that for k < n/2, the largest families of k-sets of an n-element set such that any two of its members intersect are precisely those families composed of all k-sets that contain some fixed element.
Title: A local version of Hadwiger’s ConjectureSpeaker: Lise Turner Affiliation: University of Waterloo Zoom: http://matroidunion.org/?page_id=2477 or contact Shayla Redlin
In 1943, Hadwiger famously conjectured that graphs with no $K_t$ minors are $t-1$ colourable. There has also been significant interest in several variants of the problem, such as list colouring or only forbidding certain classes of minors.