Here is a combinatorics problem having to do with graph-theory
Ten players participate at a chess tournament. Eleven games have already been played. Prove that there is a player who has played at least 3 games.
Here is a combinatorics problem having to do with graph-theory
Ten players participate at a chess tournament. Eleven games have already been played. Prove that there is a player who has played at least 3 games.