Subscribe to Events

Speaker: Hung-Hsun Yu (Princeton)

Title: The entropy method and the mixture bound

Abstract: In this talk, I will talk about applications of the entropy method and a tool that we call the mixture bound. To demonstrate how the mixture bound can be applied, I will show how one can prove Lovász's version of the Kruskal--Katona theorem. I will also present some recent results on the rainbow triangle problem, which asks to determine the maximum number of rainbow triangles in a 3-edge-colored simple graph with a given number of edges. This talk is based on joint work with Ting-Wei Chao and Maya Sankar.