Question 127
A (non-oriented) graph (without loops) with $2n$ vertices and $2n(n-1)$ edges is given, $n \gt 1$. Prove that some vertices and edges of the graph can be coloured in red in such a way that each red edge connects red vertices and each red vertex belongs to exactly $n$ red edges.