In this short note, we present a purely entropic proof that in a $3$-edge-colored simple graph with R red edges, G green edges, and B blue edges, the number of rainbow triangles is at most √2RGB.
No takes yet. Share an insight, caveat, or question.
Chao et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: