Inverse Results for Isoperimetric Inequalities - Part I

Explore the inverse isoperimetric problem in graph theory through this comprehensive lecture. Delve into the structure of vertex subsets with minimal edge connections to their complements. Examine the Fourier-Entropy-Influence conjecture, its applications in PAC learning, and its relevance to the Hamming cube's inverse isoperimetric problem. Gain insights into recent advancements towards proving the conjecture and related inverse isoperimetric inequalities. Learn about collaborative research findings from Lifshitz and colleagues, including Evra, Kelman, Kindler, Keevash, Minzer, and Safra.