Guichard-Combinatorics-Graph-Theory · Problem 1.6.1
Fundamentals
Mathematics — Probability · pigeonhole-principle
Problem
Assume that the relation ``friend'' is symmetric. Show that if n≥2, then in any group of n people there are two with the same number of friends in the group.