suppose $n$ people are in a party and every two of them have exactly one common friends,prove that there is one who is friend to all.
I suppose there is no one who is friend to all,I want to show that the graph with this assumption is strongly regular graph and then show that two parameters $f,g=\frac{1}{2}(n-1 \pm \frac{(n-1)(\lambda - \mu)+2k}{\sqrt{(\lambda-\mu)^{2}+4(k-\mu)}})$ are not non negetive integers,my problem is when I suppose there is no one who is friend to all,I can't see that it is strongly regular graph.
of course this Idea was an help that was said in class,any other ideas will be great!
thanks.
something I must add is in this case every two adjacent or non-adjacent vertex has a common friends so $\lambda =\mu =1$ (if I am not wrong )now question is what is $k$? but it seems no matter what is $k$ ,because if $\lambda =\mu =1$ then $f=\frac{1}{2}n-\frac{1}{2}$ and it is not integer,I don't know what I am saying is right or wrong,please help me about this.
The above problem is called Friendship Theorem for Erdos et al (1966), the prove is long. Here is the prove as stated in Bondy and Murty(2008)