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
NSF grant DMS-1101185, SNSF grant 200021-14911 and USA-Israel BSF grant.

Ramistrasse 101, 8092 Zurich, Switzerland

Phone: +41 44 632 4028.

Email: benjamin.sudakov@math.ethz.ch

Ramsey Theory, Random Structures, Application of Combinatorics to Theoretical Computer Science.

- Talk for Erdos Centennial
- Talk for Turan - 100 Memorial Conference
- Talk for 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

- Peter Keevash, Professor of Mathematics, Oxford University, UK. Ph.D. 2004, Princeton University.
- Boris Bukh, Assistant Professor, Carnegie Mellon University, USA. Ph.D. 2009, Princeton University.
- Po-Shen Loh, Assistant Professor, Carnegie Mellon University, USA. Ph.D. 2010, Princeton University.
- Jacob Fox, Assistant Professor, MIT, USA. Ph.D. 2010, Princeton University.
- Choongbum Lee, Postdoc, MIT, USA. Ph.D. 2012, UCLA.
- Hao Huang , Postdoc, Institute for Advanced Study/DIMACS, USA. Ph.D. 2012, UCLA.
- Shagnik Das , UCLA, in progress.
- Humberto Naves , UCLA, in progress.
- Wenying Gan, UCLA, in progress.
- Daniel Korandi, ETH, in progress.
- Pedro Vieira, ETH, in progress.

- 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

- 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).