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 flag-algebra, counting, and entropy proofs.
Kruskal-Katona-type problems via the entropy method
1 Pith paper cite this work, alongside 4 external citations. Polarity classification is still indexing.
1
Pith paper citing it
4
external citations · OpenAlex
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
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 flag-algebra, counting, and entropy proofs.