Equal Friend Counts at a Party
Medium mathematics interview practice: Equal Friend Counts at a Party.
At a party of $N \geq 2$ people with symmetric friendships, which principle proves that at least two people must have the same number of friends?
Medium mathematics interview practice: Equal Friend Counts at a Party.
At a party of $N \geq 2$ people with symmetric friendships, which principle proves that at least two people must have the same number of friends?