Let [n] be the set {1, 2,. . . , n}.
For any , denote by a graph (not directed) defined by the following rule: the vertices have the form (i, f), where , and . A vertex (i, f) and a vertex (j, g) are connected if , and holds exactly for k strictly between i and j. Prove that for any there is such that the vertices of G (a, b) cannot be well-colored with colors.