This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Benny Sudakov | |
|---|---|
| Name | Benny Sudakov |
| Birth date | 1970s |
| Birth place | Israel |
| Fields | Combinatorics; Graph Theory; Extremal Combinatorics; Ramsey Theory |
| Workplaces | Hebrew University of Jerusalem; University of Birmingham; University College London |
| Alma mater | Tel Aviv University |
| Doctoral advisor | Noga Alon |
| Known for | Extremal graph theory; Ramsey-type results; probabilistic combinatorics |
Benny Sudakov is an Israeli mathematician known for contributions to combinatorics, graph theory, and probabilistic methods. He has held positions at leading institutions and collaborated with prominent researchers in discrete mathematics, producing influential results in extremal and Ramsey-type problems. His work connects methods from probability theory, additive combinatorics, and theoretical computer science to resolve longstanding open questions.
Sudakov was born in Israel and completed his undergraduate and graduate studies at Tel Aviv University, where he studied under Noga Alon. During his doctoral period he interacted with researchers at institutions including Princeton University, University of Cambridge, and Harvard University. His early training combined influences from Israeli combinatorial tradition exemplified by Paul Erdős's collaborators and international groups centered at Microsoft Research and the Institute for Advanced Study.
Sudakov held postdoctoral and faculty appointments at several universities, including positions linked to the Hebrew University of Jerusalem, the University of Birmingham, and University College London. He has been a visiting scholar at centers such as the Mathematical Sciences Research Institute, the Fields Institute, and the Clay Mathematics Institute. Sudakov has served on program committees for conferences like the International Congress of Mathematicians, the European Congress of Mathematics, and the Symposium on Theory of Computing, and contributed to editorial boards of journals such as Journal of Combinatorial Theory, Series B, Combinatorica, and Random Structures & Algorithms.
Sudakov's research spans extremal graph theory, Ramsey theory, pseudorandomness, and probabilistic combinatorics. He proved structural results related to the Erdős–Stone theorem and worked on problems influenced by Erdős–Rényi random graphs and the Szemerédi regularity lemma. His collaborations with researchers like Noga Alon, Jeff Kahn, Van Vu, and Olga Kharlampovich (and others in combinatorics) yielded advances in embedding sparse graphs into dense hosts, improvements on bounds for Ramsey numbers, and novel uses of probabilistic concentration inequalities originating from Azuma's inequality and Talagrand's inequality. Sudakov produced work on anti-Ramsey problems and on the structure of graphs avoiding specific subgraphs tied to conjectures by Paul Erdős and Ronald Graham.
He contributed to the development of sparse pseudorandom constructions connecting to results of Benny Sudakov's collaborators in additive combinatorics and to methods used in property testing within theoretical computer science. His papers often blend combinatorial designs reminiscent of constructions by Péter Frankl and probabilistic approaches used by Joel Spencer. Sudakov's investigations into Hamiltonicity, expansion properties, and judicious partitions built upon foundations laid by Fan Chung and László Lovász.
Sudakov has received recognitions from mathematical societies and funding agencies, including grants and fellowships associated with the European Research Council, national science foundations, and prizes linked to achievements in combinatorics. He has been invited to speak at gatherings such as the International Congress of Mathematicians sectional meetings, the Jerusalem International Conference on Discrete Mathematics, and the Workshop on Graph Theory and Combinatorics.
- Sudakov, with coauthors, papers on upper and lower bounds for diagonal and off-diagonal Ramsey numbers, published in journals including Journal of the American Mathematical Society and Annals of Mathematics. - Works on embedding sparse graphs in dense graphs, appearing in Combinatorica and Journal of Combinatorial Theory, Series B. - Papers connecting probabilistic methods to combinatorial constructions, published in Random Structures & Algorithms and presented at the Symposium on Discrete Algorithms. - Expository articles and survey chapters in collections sponsored by the American Mathematical Society and the European Mathematical Society.
Sudakov’s mentorship fostered a generation of researchers in combinatorics who have joined faculties at institutions including Massachusetts Institute of Technology, Princeton University, Stanford University, and universities across Europe and Israel. His influence is evident in problems pursued by groups at the Institute for Advanced Study, the Courant Institute, and research centers linked to Google Research and Microsoft Research. Sudakov's blend of probabilistic and constructive techniques continues to shape contemporary work in extremal combinatorics, graph theory, and intersections with theoretical computer science.
Category:Israeli mathematicians Category:Combinatorialists