We say a graph H is r-rainbow-uncommon if the maximum number of rainbow copies of H under an r-coloring of E(Kₙ) is asymptotically (as n → ∞) greater than what is expected from uniformly random r-colorings. Via explicit constructions, we show that for H∈₃,K₄, K₅\, H is r-rainbow-uncommon for all r≥ |V(H)| 2. We also construct colorings to show that for t ≥ 6, Kₜ is r-rainbow-uncommon for sufficiently large r.
No takes yet. Share an insight, caveat, or question.
Bates et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: