KICK – OFF CHALLENGE

● As per given problem, An Edge is counted as the colored edge only if

it’s both vertices painted with different colors.

● Suppose, Ajai starts with choosing colors so that maximum edges will
get colored and Rekha would have to select vertex of G0 in the
manner that minimum edges will be colored.

● The best case for Rekha is only if Ajai chooses only either similar
colors or the colors that make the vertices of any triangle with the
similar color, in which Rekha will totally minimize the number of
colored edges as zero.

● The best case for Ajai is when there is six colored edges in the
triangle which is maximum number of colored edges we can have.

● For Example, Ajai and Rekha chooses color and vertex in following
fashion then we have maximum two colored edges and two triangles
of G0 Will get similar color of vertex.

Turn 1 2 3 4 5 6 7 8 9
Colors Choosen RED RED GREEN GREEN RED GREEN GREEN RED GREEN
By Ajai
Vertex Choosen A B D E C F G H I
By Rekha
 Figure 1: G0 with vertices and Colored Edges

● In Any Case, If Ajai tries to maximize the number of colored edges, he

will have maximum two colored edges and for Rekha, in any case,
she will be successful to avoid the edges of two triangles.

● So in optimal play for both players, They will left with two colored edges and seven
uncolored edges because Rekha can avoid maximum two triangles with uncolored
edges by making their vertices of same color in any pattern of color chosen by Ajai.