# Thread: [SOLVED] Matching Combinations Question and the pigeonhole principle

1. ## [SOLVED] Matching Combinations Question and the pigeonhole principle

Hi, here is a problem which I can't solve (out of a list of 12)

8 teams take part in a tournament. Each team plays each other once exactly. Prove that there are at least two teams that have played the same number of matches at any given time.

While it looks simple, I simply can't find the answer.

I've been trying for around a week now and its due tomorrow.

Thanks

2. Can matches take place at the same time as others or do they specifically have to happen one at a time?

3. Originally Posted by BG5965
8 teams take part in a tournament. Each team plays each other once exactly. Prove that there are at least two teams that have played the same number of matches at any given time.
Until seven teams have each played at least one other team, there is nothing to consider.
Because before that time there are at least two teams that have played zero matches.
Once seven teams have each played at least one other team, then consider this.
Each of those seven has played a maximum of six other teams (a team does not play itself).
We partition the seven according to the number of matches played, $1,2, \cdots ,5,6$.
Seven teams into six cells means some cell has at least two teams.