REVIEW 3 cited by
A Purely Entropic Approach to the Rainbow Triangle Problem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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 $\sqrt{2RGB}$.
Forward citations
Cited by 3 Pith papers
-
Sidorenko property and forcing in regular tournaments
For nearly regular tournaments, a tournament has the Sidorenko property exactly when it is transitive or a blow-up of the cyclic triangle whose three parts are transitive.
-
Density of rainbow triangles and properly colored $K_4$'s
A graph with R red, G green, B blue edges contains at most ¼(RGB)^{2/3} properly colored K4s, with equality only for balanced blowups of a properly colored K4; the known rainbow-triangle bound √(2RGB) receives new fla...
-
Entropy methods in combinatorics
A selective survey of entropy methods in combinatorics, detailing randomized chain rules, Shearer's inequality, random homomorphisms, Pinsker-type arguments, the union-closed sets breakthrough, and entropy approaches ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.