Question 134
Each edge of the complete graph $K_{2024}$ is coloured with one of 13 given colours. Suppose that for any such colouring one can choose $k$ colours such that any two vertices of $K_{2024}$ are connected by some path each of whose edges is coloured with one of these $k$ colours. Find the minimal possible value of $k$.