Browse · MathNet
Print3 Bulgarian Spring Tournament
Bulgaria counting and probability
Problem
Let be a positive integer. The binary strings of length are split into pairs, such that the strings in each pair differ in exactly one position. Show that there exists an alternating cycle of length at most , i.e. at most binary strings that can be arranged on a circle so that any pair of adjacent strings differ in exactly one position and exactly half of the pairs of adjacent strings are pairs in the split. (Lyuben Lichev)
Solution
Consider a graph with vertices the binary vectors of length and edges connecting the pairs of vectors that differ in exactly one position. Let be a complete -dimensional pairing. We will prove that for each vertex of we can find an alternating cycle of length no more than among the distance vectors of the most many 2 of .
Let have as neighbors in . Without loss of generality let , and the vectors form pairs in respectively with (which are at distance 2 from ). Notice that each of the vectors has exactly two neighbors among in . We will consider two cases:
Case 1. Any of the vectors , say , is a neighbor of in . Then form an alternating cycle of length .
Case 2. None of the vectors is a neighbor of in . Consider the following algorithm. At the beginning, let's place a token at vertex and at each step:
if the token is located at a vertex for some , we move it to a vertex ; if the token is located at a vertex for some , we move it to the neighbor of other than .
Obviously, after no more than runs of the algorithm, some vertex will be repeated. Since the algorithm describes a walk on the graph where every odd edge is in and every even edge is outside , it finds an alternating cycle after at most moves, whence the statement also follows in this case.
Let have as neighbors in . Without loss of generality let , and the vectors form pairs in respectively with (which are at distance 2 from ). Notice that each of the vectors has exactly two neighbors among in . We will consider two cases:
Case 1. Any of the vectors , say , is a neighbor of in . Then form an alternating cycle of length .
Case 2. None of the vectors is a neighbor of in . Consider the following algorithm. At the beginning, let's place a token at vertex and at each step:
if the token is located at a vertex for some , we move it to a vertex ; if the token is located at a vertex for some , we move it to the neighbor of other than .
Obviously, after no more than runs of the algorithm, some vertex will be repeated. Since the algorithm describes a walk on the graph where every odd edge is in and every even edge is outside , it finds an alternating cycle after at most moves, whence the statement also follows in this case.
Techniques
Matchings, Marriage Lemma, Tutte's theoremPigeonhole principle