Discussion: This student approaches the problem indirectly through proof by contradiction. He assumes that every vertex has red degree 3 and concludes that the total red degree is then 27. However, the total red degree of the graph is twice the number of the red edges since each vertex on a red edge is counted twice. Then by an appeal to parity this is impossible.

Click the image to the left to bring up an enlarged copy of the solution