Editing Discrete geometry (section)

===Topological combinatorics===
{{main|Topological combinatorics}}
The discipline of combinatorial topology used combinatorial concepts in [[topology]] and in the early 20th century this turned into the field of [[algebraic topology]].

In 1978, the situation was reversed – methods from algebraic topology were used to solve a problem in [[combinatorics]] – when [[László Lovász]] proved the [[Kneser graph|Kneser conjecture]], thus beginning the new study of '''topological combinatorics'''. Lovász's proof used the [[Borsuk-Ulam theorem]] and this theorem retains a prominent role in this new field. This theorem has many equivalent versions and analogs and has been used in the study of [[fair division]] problems.

Topics in this area include:
*[[Sperner's lemma]]
*[[Regular map (graph theory)|Regular maps]]