Rainbow independent triangles in complete split graphs

Q. Wang and Z.M. Jin

Applied Mathematics and Computation, 2025, vol. 507, issue C

Abstract: For two graphs K and H, where K contains H as a subgraph, the anti-Ramsey number of H in K, denoted by AR(K,H), is the largest integer k such that there exists a k-edge-coloring of K containing no rainbow H. Let 2C3 denote the union of two independent triangles. In this paper we obtain the value of AR(Ks‾+Kn,2C3) for s≥1,n≥4 and s+n≥6.

Keywords: Rainbow graph; Anti-Ramsey number; Triangle (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325003157
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:507:y:2025:i:c:s0096300325003157

DOI: 10.1016/j.amc.2025.129589

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 ().