Rainbow disjoint union of P4 and a matching in complete graphs

Zemin Jin, Qing Jie and Zhenxin Cao

Applied Mathematics and Computation, 2024, vol. 474, issue C

Abstract: An edge-colored graph G is called rainbow if all the colors on its edges are distinct. Given graphs G and H, the anti-Ramsey number AR(G,H) is the maximum number k such that there exists an edge-coloring of G with exactly k colors containing no rainbow copy of H. Recently, the anti-Ramsey problem for disjoint union of graphs received much attention. In particular, several researchers focused on the problem for graphs consisting of small components. In this paper, we continue the work in this line. We refine the bound of n and determine the precise value of AR(Kn,P4∪tP2) for all n≥2t+4 in complete graphs.

Keywords: Rainbow graph; Anti-Ramsey number; Disjoint union of graphs (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324001516
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001516

DOI: 10.1016/j.amc.2024.128679

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().