Year: 2025
Type: preprint
Abstract: 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].
Source: arXiv (Cornell University)
Authors: Liu, Zhen, Zeng, Qinghou
Institution: Fuzhou University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Award: G8874812387
OpenAlex ID: W6979274634
Cites:
Cited by:
Related to: