Friendship theorem: A combinatorial proof
Combinatorics
2024-02-13 v2
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.
Cite
@article{arxiv.2402.05504,
title = {Friendship theorem: A combinatorial proof},
author = {Vineeth Chintala},
journal= {arXiv preprint arXiv:2402.05504},
year = {2024}
}
Comments
This short proof is flawed. The result (which is a well known theorem) is still true. Please ignore the paper