# Thread: graph or prove problem

1. ## graph or prove problem

(i) Can there be a collection of 4 persons in which every person has exactly two friends?
(ii) Can there be a collection of 6 persons in which every person has exactly three friends?
(iii) How about a collection of 7 persons in which every person has exactly three friends?

For each case draw the friendship graph if such setting is possible, or prove it is impossible.

please explain to me thank you!!

2. Originally Posted by quah13579
(i) Can there be a collection of 4 persons in which every person has exactly two friends?
(ii) Can there be a collection of 6 persons in which every person has exactly three friends?
(iii) How about a collection of 7 persons in which every person has exactly three friends?
i) Think rectangle.
ii) Think $K_{3,3}$
iii) Can a graph have an odd number of odd vertices?