  We discuss five discrete results: the lemmas of Sperner and Tucker from
combinatorial topology and the theorems of Carath\'eodory, Helly, and Tverberg
from combinatorial geometry. We explore their connections and emphasize their
broad impact in application areas such as game theory, graph theory,
mathematical optimization, computational geometry, etc.
