Anti-Ramsey number of intersecting cliques
Discrete Mathematics · 2027-02 · 350 (2) · 115439
DOI: 10.1016/j.disc.2026.115439 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2027-02. Verfasst von Hongliang Lu und 2 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Gefördert von: National Natural Science Foundation of China, National Key Research and Development Program of China.
Abstract (Originalsprache)
An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The anti-Ramsey number $ar(n, G)$, for a graph $G$ and a positive integer $n$, is defined as the minimum number of colors $r$ such that every exact $r$-edge-coloring of the complete graph $K_n$ contains at least one rainbow copy of $G$. A $(k, r)$-fan graph, denoted $F_{k, r}$, is a graph composed of $k$ cliques each of size $r$, all intersecting at exactly one common vertex. In this paper, we determine $ar(n, F_{k, r})$ for $n \geq 256r^{16}(k+1)^5$, $k \geq 1$, and $r \geq 2$.
Förderung
- National Natural Science Foundation of China
- National Key Research and Development Program of China
Zitieren
APA
Lu, H., Luo, X., & Ma, X. (2027). Anti-Ramsey number of intersecting cliques. Discrete Mathematics, 350(2), 115439. https://doi.org/10.1016/j.disc.2026.115439
Vancouver
Lu H, Luo X, Ma X. Anti-Ramsey number of intersecting cliques. Discrete Mathematics. 2027;350(2):115439. doi:10.1016/j.disc.2026.115439
BibTeX
@article{Lu2027,
author = {Lu, Hongliang and Luo, Xinyue and Ma, Xinxin},
title = {Anti-Ramsey number of intersecting cliques},
journal = {Discrete Mathematics},
year = {2027},
volume = {350},
number = {2},
pages = {115439},
doi = {10.1016/j.disc.2026.115439}
}
EUVIMED