Geodesic
Combinatorial necklace splitting
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/168
Classification : 05A18, 05D99, 55M20 
@article{10_37236_168,
     author = {D\"om\"ot\"or P\'alv\"olgyi},
     title = {Combinatorial necklace splitting},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/168},
     zbl = {1186.05017},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/168/}
}
TY  - JOUR
AU  - Dömötör Pálvölgyi
TI  - Combinatorial necklace splitting
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/168/
DO  - 10.37236/168
ID  - 10_37236_168
ER  - 
%0 Journal Article
%A Dömötör Pálvölgyi
%T Combinatorial necklace splitting
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/168/
%R 10.37236/168
%F 10_37236_168
Dömötör Pálvölgyi. Combinatorial necklace splitting. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/168

Cité par Sources :