Painting edges of a complete graph red or blue
Source: Junior Olympiad of Malaysia 2014 P3
July 20, 2015
combinatoricsgraph theory
Problem Statement
There is a complete graph with vertices drawn on the whiteboard. Ivan paints all the edges by red or blue colour. Find all ordered pairs such that Ivan can paint the edges so that every vertex is connected to exactly red edges and blue edges.