The Friendship Problem on Graphs
In this paper we provide a purely combinatorial proof of the Friendship Theorem, which has been first proven by P. Erdet al. by using also algebraic methods. Moreover, we generalize this theorem in a natural way, assuming that every pair of nodes occupies ≥ 2 common neighbors. We prove that every graph, which satisfies this generalized -friendship condition, is a regular graph.