A Purely Entropic Approach to the Rainbow Triangle Problem
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.