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.