Benny Sudakov

Benny Sudakov is a Professor of Mathematics at ETH Zurich, where he conducts research in combinatorics. He has previously held positions at UCLA, Princeton University, and the Institute for Advanced Study. His work is supported by the SNSF grant 200021_196965.

Research Interests: His primary research areas include Extremal Graph and Hypergraph Theory, Ramsey Theory, Random Structures, and the application of Algebraic and Probabilistic Methods in Combinatorics, with strong connections to Theoretical Computer Science. He investigates fundamental structural properties of discrete systems, such as the existence of regular subgraphs, extremal configurations, and the behavior of random combinatorial objects.

The recent popular science articles on his work highlight a consistent trend of solving long-standing open problems in extremal combinatorics using sophisticated probabilistic and algebraic techniques. His research spans topics like equiangular lines, graph decompositions, and the emergence of cycles in sparse graphs, demonstrating a deep focus on the interplay between structure and randomness.

• Scientific Awards: No specific awards are mentioned in the provided text.

Advising and Grants: He has advised numerous Ph.D. students, many of whom have gone on to become professors at top universities (e.g., Oxford, Stanford, CMU, ETH, Princeton). His research is currently funded by the Swiss National Science Foundation (SNSF). He has organized workshops and seminars, such as the Theory of Combinatorial Algorithms Mittagsseminar at ETH and a workshop at UCLA on Extremal and Probabilistic Combinatorics.

Labs and Teams: He is a key member of the combinatorics group at ETH Zurich and co-organizes the Theory of Combinatorial Algorithms Mittagsseminar, a central forum for research discussions in discrete mathematics at the institution.