Upper bounds for the necklace folding problems

Endre Csóka, Zoltán L. Blázsik, Zoltán Király +1

A necklace can be considered as a cyclic list of $n$ red and $n$ blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs…