Friendship theorem: A combinatorial proof

Abstract

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.

This short proof is flawed. The result (which is a well known theorem) is still true. Please ignore the paper