1 problem

Let $K_n$ be a complete graph with a proper edge-colouring, meaning that any two incident edges have different colours. A subgraph is rainbow if all its edges have distinct colours…