Fall 2016, problem 33
Let $n$ and $k$ be positive integers. There are $nk$ objects (of the same size) and $k$ boxes, each of which can hold $n$ objects. Each object is colored in one of $k$ different colors. Show that the objects can be packed in the boxes so that each box holds objects of at most two colors.