Year: 2024
Type: preprint
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 $\sqrt{2RGB}$.
Source: arXiv (Cornell University)
Authors: Chao, Ting-Wei, Yu, Hung-Hsun Hans
Institutions: Massachusetts Institute of Technology, Princeton University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4402855729