Unlucky Graph with 13 colors
Source: 2024 Turkey EGMO TST P3
February 12, 2024
graph theorycombinatorics
Problem Statement
Initially, all edges of the are painted with different colors. If there exist colors such that the subgraph constructed by the edges which are colored with these colors is connected no matter how the initial coloring was, find the minimum value of .