Discrete splittings of the necklace - École des Ponts ParisTech Access content directly
Journal Articles Mathematics of Operations Research Year : 2008

Discrete splittings of the necklace


This paper deals with, direct proofs and combinatorial proofs of the famous necklace theorem of Alon, Goldberg, and West. The new results are a direct proof for the case of two thieves and three types of beads, and an efficient constructive proof for the general case with two thieves. This last proof uses a theorem of Ky Fan which is a version of Tucker's lemma concerning cubical complexes instead of Simplicial complexes. © 2008 INFORMS.
No file

Dates and versions

hal-00740623 , version 1 (10-10-2012)



Frédéric Meunier. Discrete splittings of the necklace. Mathematics of Operations Research, 2008, 33 (3), pp.678. ⟨10.1287/moor.1080.0311⟩. ⟨hal-00740623⟩
102 View
0 Download



Gmail Facebook X LinkedIn More