Benny Sudakov

I am a Professor of Mathematics at ETH, Zurich. Before coming to ETH, I enjoyed the hospitality of University of California, Los Angeles, Princeton University and Institute for Advanced Study. I got my Ph.D. in 1999 from the School of Mathematical Sciences, Tel Aviv University. My advisor was Noga Alon.

My work is supported by SNSF grant 200021_196965.

Contact me

Fields of interest

Curriculum Vitae

• My CV

My research

• On-line available papers


• A piece on my research in Quanta (popular science magazine): A New Path to Equal-Angle Lines. This research answered an old question about the maximum number of lines one can find in Euclidean space, such that any pair of them forms the same fxed angle.


• Another piece in Quanta about the solution of Ringel's tree-packing conjecture from 1963: Rainbow Proof Shows Graphs Have Uniform Parts.


• Mathematical Connect-the-Dots Reveals How Structure Emerges, Quanta article about the solution of the old question of Erdos and Sauer: How dense should be a graph to contain a regular subgraph?


• A story from Quanta about Hamiltonicity of sparse expander graphs: In Highly Connected Networks, There’s Always a Loop,

Birthday conference

BennyFest

Special thanks to Jacob Fox for oprganizing, Matija Bucic for the webcite and Christa Lachmuth all my group for their support.

Ph.D students

• Peter Keevash, Professor of Mathematics, Oxford University, UK  (Ph.D. 2004, Princeton University).
• Jacob Fox, Professor of Mathematics, Stanford Unversity, USA  (Ph.D. 2010, Princeton University).
• Boris Bukh, Professor, Carnegie Mellon University, USA  (Ph.D. 2009, Princeton University).
• Po-Shen Loh, Professor, Carnegie Mellon University, USA  (Ph.D. 2010, Princeton University).
• Choongbum Lee, Finanace industry, New York  (Ph.D. 2012, UCLA).
• Hao Huang , Associate Professor, National University of Singapore  (Ph.D. 2012, UCLA).
• Shagnik Das , Postdoc, Frei University, Berlin  (Ph.D. 2014, UCLA).
• Humberto Naves, Finanace industry, New York  (Ph.D. 2014, UCLA).
• Wenying Gan, Finanace industry, New York  (Ph.D. 2014, UCLA).
• Daniel Korandi, Postdoc, Oxford, UK  (Ph.D 2016 ETH).
• Pedro Vieira, Data Scientist in Industry, Zurich  (Ph.D 2017 ETH).
• Matthew Kwan, Assistant Professor, IST Austria  (Ph.D. 2018, ETH).
• Nina Kamcev, Associate Professor, University of Zagreb  (Ph.D. 2018, ETH).
• Igor Balla, postdoc, Tel Aviv University  (Ph.D. 2019, ETH).
• Matija Bucic, Assistant Professor, Princeton University and IAS  (Ph.D. 2021, ETH).
• Nemanja Draganic, postdoc, Oxford University  (Ph.D. 2023, ETH).
• David Munha Correia, ETH, in progress.
• Domagoj Bradac, ETH, in progress.
• Zhihan Jin, ETH, in progress.
• Aleksa Milojevic, ETH, in progress.

Talks

• Grid Ramsey problem and related questions, ICM Satellite Workshop, Korea.
• Paul Erdos and Graph Ramsey Theory, Erdos Centennial, Budapest.
• Turan's Theorem: generalizations and applications, Turan Centennial, Budapest.
• Recent developments in Extremal Combinatorics, ICM 2010, Haiderabad, India.
• Kakeya-type problems and small bases
• Density theorems for bipartite graphs and related Ramsey-type results
• Nearly optimal embeddings of trees
• Cycles and clique-minors in expanders
• Induced Ramsey-type theorems
• Turan's theorem: variations and generalizations
• (n,d,\lambda)-graphs: properties and applications

Workshops and seminars

• Theory of Combinatorial Algorithms Mittagsseminar, ETH, Zurich.
• Extremal and Probabilistic Combinatorics, UCLA, January 2013.
• New Trends and Directions in Combinatorics , Banff Resecrh Center, 2012.
• Hypergraph Turan problem, American Institute of Mathematics, Palo Alto, California, March 2011.
• Workshop on Combinatorics, Mathematical Institute, Oberwolfach, January 2011.
• Extremal and Probabilistic Combinatorics, AMS 2010 Fall Western Section Meeting.
• Combinatorics: Methods and Applications in Mathematics and Computer Science, Institute for Pure and Applied Mathematics (IPAM), UCLA, September 8 - December 11, 2009.
• Probabilistic and Extremal Combinatorics, Banff Resecrh Center, August 23-28, 2009.
• Workshop on Properties of Large Graphs: From Combinatorics to Statistical Physics and Back, DIMACS, Rutgers University
• Mini-symposium on Probabilistic Combinatorics: Part I and Part II, 2006 SIAM Discrete Mathematics Conference, Victoria
• Probabilistic Combinatorics, Banff Resecrh Center, 2005. Here is group photo of participants from this meeting.
• Extremal and Probabilistic Combinatorics, AMS Eastern Section Meeting

Coauthors

Teaching

• Graph theory. ETH, Spring 2015
• Algebraic Methods in Combinatorics Math 218B. Winter 2013
• Probabilistic Method in Combinatorics Math 218A.
• Analytical Methods in Discrete Mathematics (a.k.a Discrete Fourier Analysis), Math 218C.
• MAT 180: Combinatorics.
• Topics in Discrete Mathematics Math 218C.
• MAT 307: Combinatorics (in Princeton).