Constructing graphs satisfying conditions on degrees
Source: EGMO 2017 P4
April 9, 2017
combinatoricsgraph theoryvertex degreeEGMOEGMO 2017
Problem Statement
Let be an integer and let be positive integers. In a group of people, some games of chess are played. Two people can play each other at most once. Prove that it is possible for the following two conditions to hold at the same time: (i) The number of games played by each person is one of .(ii) For every with , there is someone who has played exactly games of chess.