Explore BrainMass

Graph theory

Show that it is impossible for an odd number of people in a group to each know exactly 2k+1 other people in the group for any integer k.

Solution Preview

Let r be the number of people in the group. Construct a graph G on r vertices representing the r ...

Solution Summary

This is a proof regarding odd numbers of people in a group.