Tucker's lemma

From Wikipedia, the free encyclopedia

In mathematics, Tucker's lemma is a combinatorial analog of the Borsuk–Ulam theorem.

[edit] See also

• Brouwer fixed point theorem
• Borsuk–Ulam theorem
• Topological combinatorics

[edit] References

• Jiří Matoušek (2003). Using the Borsuk–Ulam Theorem. Springer-Verlag. pp. 34. ISBN 3-540-00362-2. 

This mathematics-related article is a stub. You can help Wikipedia by expanding it.