A Purely Entropic Approach to the Rainbow Triangle Problem

July 19, 2024 · The Ethereal · 🏛 arXiv.org

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ting-Wei Chao, Hung-Hsun Hans Yu arXiv ID 2407.14084 Category math.CO: Combinatorics Cross-listed cs.IT Citations 3 Venue arXiv.org Last Checked 2 months ago
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}$.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Combinatorics

🔮 🔮 The Ethereal

Tables of subspace codes

Daniel Heinlein, Michael Kiermaier, ... (+2 more)

math.CO 🏛 arXiv 📚 94 cites 10 years ago