Rainbow disjoint union of clique and matching in edge-colored complete graph
Discussiones Mathematicae. Graph Theory, Tome 44 (2024) no. 3, pp. 953-970

Voir la notice de l'article provenant de la source Library of Science

Given an edge-coloring of a graph G, G is said to be rainbow if any two edges of G receive different colors. The anti-Ramsey number AR(G,H) is defined to be the maximum integer k such that there exists a k-edge-coloring of G avoiding rainbow copies of H. The anti-Ramsey number for graphs, especially matchings, have been studied in several graph classes. Gilboa and Roditty focused on the anti-Ramsey number of graphs with small components, especially including a matching. In this paper, we continue the work in this direct and determine the exact value of the anti-Ramsey number of K_4∪ tP_2 in complete graphs. Also, we improve the bound and obtain the exact value of AR(K_n,C_3∪ tP_2) for all n≥ 2t+3.
Keywords: rainbow matching, anti-Ramsey number, clique
@article{DMGT_2024_44_3_a7,
     author = {Jin, Zemin and Gu, Junqi},
     title = {Rainbow disjoint union of clique and matching in edge-colored complete graph},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {953--970},
     publisher = {mathdoc},
     volume = {44},
     number = {3},
     year = {2024},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2024_44_3_a7/}
}
TY  - JOUR
AU  - Jin, Zemin
AU  - Gu, Junqi
TI  - Rainbow disjoint union of clique and matching in edge-colored complete graph
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2024
SP  - 953
EP  - 970
VL  - 44
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2024_44_3_a7/
LA  - en
ID  - DMGT_2024_44_3_a7
ER  - 
%0 Journal Article
%A Jin, Zemin
%A Gu, Junqi
%T Rainbow disjoint union of clique and matching in edge-colored complete graph
%J Discussiones Mathematicae. Graph Theory
%D 2024
%P 953-970
%V 44
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2024_44_3_a7/
%G en
%F DMGT_2024_44_3_a7
Jin, Zemin; Gu, Junqi. Rainbow disjoint union of clique and matching in edge-colored complete graph. Discussiones Mathematicae. Graph Theory, Tome 44 (2024) no. 3, pp. 953-970. http://geodesic.mathdoc.fr/item/DMGT_2024_44_3_a7/