MathDB
Constructing graphs satisfying conditions on degrees

Source: EGMO 2017 P4

April 9, 2017
combinatoricsgraph theoryvertex degreeEGMOEGMO 2017

Problem Statement

Let n1n\geq1 be an integer and let t1<t2<<tnt_1<t_2<\dots<t_n be positive integers. In a group of tn+1t_n+1 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 t1,t2,,tnt_1,t_2,\dots,t_n.
(ii) For every ii with 1in1\leq i\leq n, there is someone who has played exactly tit_i games of chess.