A Purely Entropic Approach to the Rainbow Triangle Problem
<|reference_start|>A Purely Entropic Approach to the Rainbow Triangle Problem: 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}$.<|reference_end|>
@article{chao2024a,
    title={A Purely Entropic Approach to the Rainbow Triangle Problem},
    author={Ting-Wei Chao, Hung-Hsun Hans Yu},
    journal={arXiv preprint arXiv:2407.14084},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.14084},
    primaryClass={math.CO cs.IT math.IT}
}