Description of a solution of the <a href="//commons.wikimedia.org/w/index.php?title=Necklace_splitting_problem&amp;action=edit&amp;redlink=1" class="new" title="Necklace splitting problem (page does not exist)">necklace splitting problem</a> with k=2 (ie two thieves) and t=2 (ie two types of beads, here red and green).  Alon's theorem shows that a 2-split is possible, with cuts as indicated.
<a href="//commons.wikimedia.org/w/index.php?title=User:Robinhankin&amp;action=edit&amp;redlink=1" class="new" title="User:Robinhankin (page does not exist)">Robinhankin</a>
<span class="int-own-work" lang="en">Own work</span>