Combinatorial necklace splitting (Q2380234)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial necklace splitting |
scientific article |
Statements
Combinatorial necklace splitting (English)
0 references
26 March 2010
0 references
Summary: We give a new, combinatorial proof for the necklace splitting problem for two thieves using only Tucker's lemma (a combinatorial version of the Borsuk-Ulam theorem). We show how this method can be applied to obtain a related recent result of Simonyi and even generalize it.
0 references
