A Purely Entropic Approach to the Rainbow Triangle Problem
arXiv:2407.14084
Abstract
In this short note, we present a purely entropic proof that in a -edge-colored simple graph with red edges, green edges, and blue edges, the number of rainbow triangles is at most .
5 pages, 5 figures