Note on the anti-Ramsey number for matching in hypercubes

Rui Li, Yuede Ma, Zhongmei Qin and Yingping Zhao

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

Abstract: Let Q be a host graph and L⊆Q be a subgraph. The anti-Ramsey numberar(Q,L) of L in Q, is defined as the largest number t that allows the existence of a t-edge-colored Q which contains no rainbow L. In this paper, the anti-Ramsey number for matchings when the host graph is hypercube is considered and some exact results are provided.

Keywords: Anti-Ramsey number; Matching; Hypercube; Edge-coloring (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

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

DOI: 10.1016/j.amc.2024.129154

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