Combinatorial Necklace Splitting

  • Dömötör Pálvölgyi
DOI: https://doi.org/10.37236/168

Abstract

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
2009-07-02
Issue
Volume 16, Issue 1 (2009)
Article Number
R79