Browse · MathNet
PrintBulgarian Winter Tournament
Bulgaria counting and probability
Problem
The sides and diagonals of a regular -gon are colored in colors. For each color , between every two vertices of the polygon there exists a path consisting only of segments of color . Prove that there exist three vertices of the polygon , , and such that the line segments , , and are multicolor.
(Emil Kolev)
(Emil Kolev)
Solution
We need to prove that in a complete graph with vertices and colors, where the induced graph on each color is connected, there exists a multicolor triangle. Denote the colors by , , , , and recolor all edges that are in any of the colors , , , into color . The new graph satisfies the condition of connectivity on each color and if there is a multicolored triangle for it, then the same triangle in the initial graph will also be multicolored. Therefore, we can consider that .
Suppose that the statement is not true for a graph , as we can choose to have a minimal number of vertices. It follows from the minimality of that after removing any vertex, the new graph will not be connected by any of the colors, and let it be color . Denote by the color connectivity components after deleting vertex . Since is color connected, there exist for which is color . The segment is not color because and are different components of connectivity. Let it be of color . If is a color segment of , then the segment cannot be of color because and are different connectivity components; cannot be of color , because then is a multicolor triangle and is therefore of color . Analogously, it is proved that all segments between the points of and are of color . We obtained that all segments between any two connectivity components are either color or color .
Now consider segments and in colors and , respectively (such segments exist, since is connected in each of the colors). Without limitation, we have the following two cases:
1. , then one of the triangles and is multicolored.
2. and , then one of the triangles and is multicolored.
The resulting contradiction shows that for every graph with the given properties there exists a multicolored triangle.
Suppose that the statement is not true for a graph , as we can choose to have a minimal number of vertices. It follows from the minimality of that after removing any vertex, the new graph will not be connected by any of the colors, and let it be color . Denote by the color connectivity components after deleting vertex . Since is color connected, there exist for which is color . The segment is not color because and are different components of connectivity. Let it be of color . If is a color segment of , then the segment cannot be of color because and are different connectivity components; cannot be of color , because then is a multicolor triangle and is therefore of color . Analogously, it is proved that all segments between the points of and are of color . We obtained that all segments between any two connectivity components are either color or color .
Now consider segments and in colors and , respectively (such segments exist, since is connected in each of the colors). Without limitation, we have the following two cases:
1. , then one of the triangles and is multicolored.
2. and , then one of the triangles and is multicolored.
The resulting contradiction shows that for every graph with the given properties there exists a multicolored triangle.
Techniques
Coloring schemes, extremal argumentsInduction / smoothing