Equating three degrees of graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910924709822464 |
|---|---|
| author | Liu, Zhen Zeng, Qinghou |
| author_facet | Liu, Zhen Zeng, Qinghou |
| contents | In this paper, we prove that, for every graph with at least 5 vertices, one can delete at most 3 vertices such that the subgraph obtained has at least three vertices with the same degree. This solves an open problem of Caro, Shapira and Yuster [Electron. J. Combin. 21 (2014) P1.24]. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_00504 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Equating three degrees of graphs Liu, Zhen Zeng, Qinghou Combinatorics In this paper, we prove that, for every graph with at least 5 vertices, one can delete at most 3 vertices such that the subgraph obtained has at least three vertices with the same degree. This solves an open problem of Caro, Shapira and Yuster [Electron. J. Combin. 21 (2014) P1.24]. |
| title | Equating three degrees of graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2505.00504 |