Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
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, a key problem in the Hamming cube's inverse isoperimetric landscape, and its applications to PAC learning and other fields. Discover recent advancements towards proving this conjecture and related inverse isoperimetric inequalities. Learn about collaborative research findings from Lifshitz and colleagues, including Evra, Kelman, Kindler, Keevash, Minzer, and Safra.
