Logo

Mathematical Sciences Research Institute

Home » Combinatorial Fixed Point Theorems Working Group: Tucker’s lemma: applications and generalizations

Seminar

Combinatorial Fixed Point Theorems Working Group: Tucker’s lemma: applications and generalizations September 14, 2017 (02:00 PM PDT - 03:00 PM PDT)
Parent Program:
Location: MSRI: Baker Board Room
Speaker(s) Frédéric Meunier (École Nationale des Ponts-et-Chaussées)
Description No Description
Video
No Video Uploaded
Abstract/Media

Tucker’s lemma is the combinatorial version of the Borsuk-Ulam theorem. It provides an elementary access to this latter as well as alternative constructive proofs of its classical applications to combinatorics (colorings of Kneser graphs, necklace splitting, ham sandwich, …). My talk aims at being a gentle introduction to that topic and at presenting generalizations of Tucker’s lemma and related open problems.

No Notes/Supplements Uploaded No Video Files Uploaded