Regular biography
Benjamin Sudakov is a Professor in the Department of Mathematics at ETH Zurich. His research interests are not explicitly detailed in the provided information. Sudakov is affiliated with the Institute for Operations Research and serves as Director of Studies. His professional profile can be accessed through the department's website.
Scholar-generated biography
Benjamin Sudakov is a researcher in combinatorics, focusing on problems related to random graphs, Ramsey theory, and extremal graph theory. His work explores the properties of large graphs, including the detection of hidden structures, the behavior of eigenvalues in sparse graphs, and the existence of matchings in hypergraphs. Sudakov has contributed to the understanding of pseudo-random graphs, Turán numbers, and Ramsey-type questions. His research also includes acyclic edge colorings, local resilience of graphs, and the phase transition in random graphs. His publications often address the interplay between probabilistic methods and combinatorial structures, with applications in theoretical computer science and discrete mathematics.