Geodesic
A note on forcing 3-repetitions in degree sequences
Discussiones Mathematicae. Graph Theory, Tome 43 (2023) no. 2, pp. 457-462 Cet article a éte moissonné depuis la source Library of Science

Voir la notice de l'article

In Caro, Shapira and Yuster [Forcing k-repetitions in degree sequences, Electron. J. Combin. 21 (2014) #P1.24] it is proven that for any graph G with at least 5 vertices, one can delete at most 6 vertices such that the subgraph obtained has at least three vertices with the same degree. Furthermore they show that for certain graphs one needs to remove at least 3 vertices in order that the resulting graph has at least 3 vertices of the same degree. In this note we prove that for any graph G with at least 5 vertices, one can delete at most 5 vertices such that the subgraph obtained has at least three vertices with the same degree. We also show that for any triangle-free graph G with at least 6 vertices, one can delete at most one vertex such that the subgraph obtained has at least three vertices with the same degree and this result is tight for triangle-free graphs.
Keywords: repeated degrees 
@article{DMGT_2023_43_2_a9,
     author = {Kogan, Shimon},
     title = {A note on forcing 3-repetitions in degree sequences},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {457--462},
     year = {2023},
     volume = {43},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2023_43_2_a9/}
}
TY  - JOUR
AU  - Kogan, Shimon
TI  - A note on forcing 3-repetitions in degree sequences
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2023
SP  - 457
EP  - 462
VL  - 43
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DMGT_2023_43_2_a9/
LA  - en
ID  - DMGT_2023_43_2_a9
ER  - 
%0 Journal Article
%A Kogan, Shimon
%T A note on forcing 3-repetitions in degree sequences
%J Discussiones Mathematicae. Graph Theory
%D 2023
%P 457-462
%V 43
%N 2
%U http://geodesic.mathdoc.fr/item/DMGT_2023_43_2_a9/
%G en
%F DMGT_2023_43_2_a9
Kogan, Shimon. A note on forcing 3-repetitions in degree sequences. Discussiones Mathematicae. Graph Theory, Tome 43 (2023) no. 2, pp. 457-462. http://geodesic.mathdoc.fr/item/DMGT_2023_43_2_a9/

[1] Y. Caro, A. Shapira and R. Yuster, Forcing k-repetitions in degree sequences, Electron. J. Combin. 21 (2014) #P1.24. https://doi.org/10.37236/3503

[2] P. Erdős, G. Chen, C.C. Rousseau and R.H. Schelp, Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs, European J. Combin. 14 (1993) 183–189. https://doi.org/10.1006/eujc.1993.1023

[3] P. Erdős, S. Fajtlowicz and W. Staton, Degree sequences in triangle-free graphs, Discrete Math. 92 (1991) 85–88. https://doi.org/10.1016/0012-365X(91)90269-8