Speaker: |
Rakesh Venkat |

Organiser: |
Tulasi mohan Molli |

Date: |
Thursday, 12 Mar 2015, 14:00 to 15:00 |

Venue: |
D-405 (D-Block Seminar Room) |

(Scan to add to calendar)

Perhaps surprisingly, this theorem can be used to prove the fact that the Kneser-Graph (n,k) has chromatic number exactly n-2k+2 (conjectured by Kneser, proven first by Lovasz in 1978). We will see this and a couple more applications of (variants of) the Borsuk-Ulam theorem in the talk. For some of these results, no purely combinatorial proofs are known.