Loading...
research article
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.
Type
research article
DOI
Web of Science ID
WOS:000269033400002
Authors
Publication date
2009
Publisher
Published in
Volume
16
Start page
R79
Subjects
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
November 24, 2010
Use this identifier to reference this record