A Purely Entropic Approach to the Rainbow Triangle Problem

Ting-Wei Chao, Hung-Hsun Hans Yu

Published 2024-07-19Version 1

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 $\sqrt{2RGB}$.