Stability of the independence number of $G(n, r, 1)$ graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911224601509888 |
|---|---|
| author | Koshelev, M. |
| author_facet | Koshelev, M. |
| contents | In this paper we obtain the stability theorem for the independence number of $G(n, r, 1)$ graphs. This result was previously stated in the paper of M. Pyaderkin but the proof there was incorrect. We introduce the correct proof of the key lemma and thus finally complete the proof of this theorem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_18850 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Stability of the independence number of $G(n, r, 1)$ graphs Koshelev, M. Combinatorics In this paper we obtain the stability theorem for the independence number of $G(n, r, 1)$ graphs. This result was previously stated in the paper of M. Pyaderkin but the proof there was incorrect. We introduce the correct proof of the key lemma and thus finally complete the proof of this theorem. |
| title | Stability of the independence number of $G(n, r, 1)$ graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2510.18850 |