Combinatorial Necklace Splitting
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.
Saved in:
| Published in | The Electronic journal of combinatorics Vol. 16; no. 1 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
02.07.2009
|
| Online Access | Get full text |
| ISSN | 1077-8926 1097-1440 1077-8926 |
| DOI | 10.37236/168 |
Cover
| 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. |
|---|---|
| ISSN: | 1077-8926 1097-1440 1077-8926 |
| DOI: | 10.37236/168 |