Friendship theorem: A combinatorial proof
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917586799689728 |
|---|---|
| author | Chintala, Vineeth |
| author_facet | Chintala, Vineeth |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_05504 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Friendship theorem: A combinatorial proof Chintala, Vineeth Combinatorics 05C35, 05C12 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. |
| title | Friendship theorem: A combinatorial proof |
| topic | Combinatorics 05C35, 05C12 |
| url | https://arxiv.org/abs/2402.05504 |