  We present an elementary combinatorial proof of the celebrated Friendship
theorem. The proof involves looking at independent sets and constructing a
bound on their size which forces a contradiction.
