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.


Published in:
Electronic Journal Of Combinatorics, 16, -
Year:
2009
Publisher:
American Mathematical Society
ISSN:
1077-8926
Keywords:
Laboratories:




 Record created 2010-11-24, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)