Student APS
Speaker: Garima Khetawat, IIT Bombay
Host: Niranjan Balachandran
Title: A purely entropic approach to the rainbow triangle problem.
Time, day and date: 11:30:00 AM – 12:30:00 PM, Thursday, February 19
Venue: Room 113
Abstract: In this talk, we will discuss a proof that in a 3-edge colored simple graph with R red edges, B blue edges and G green edges, the number of rainbow triangles is at most \sqrt{2RGB}. This proof, given by Ting-Wei Chao and Hung-Hsun Hans Yu (2024), is different from other entropic proofs in the sense that in other proofs, entropy does not play a central role after all the terms are expressed in terms of probability of certain events. But this proof remains in the realm of the entropy method throughout.