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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.