Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the inverse isoperimetric problem in graph theory through this 1-hour 19-minute lecture by Noam Lifshitz at the Hausdorff Center for Mathematics. Delve into the structure of vertex subsets with minimal edge connections to their complements. Examine the Fourier-Entropy-Influence conjecture, a notable problem in this field, and its applications to PAC learning and other areas. Learn about recent progress towards this conjecture and related inverse isoperimetric inequalities. Gain insights from joint works with Evra, Kelman, Kindler, Keevash, Minzer, and Safra.
