World's Best Scientists 2026 revealed!
Benny Sudakov

Benny Sudakov

D-Index & Metrics

Mathematics

D-Index
57
Citations
11384
World Ranking
699
National Ranking
12

Engineering and Technology

D-Index
57
Citations
11073
World Ranking
2682
National Ranking
45

Research.com Recognitions

  • 2019 - Member of Academia Europaea
  • 2013 - Fellow of the American Mathematical Society
  • 2004 - Fellow of Alfred P. Sloan Foundation

Overview

Benny Sudakov is affiliated with ETH Zurich in Switzerland and has a strong research presence in mathematics and computer science. Their work primarily focuses on various aspects of graph theory, computational theory, and discrete mathematics, with significant contributions to advanced topology and set theory.

Among the main fields of study covered in their publications are:

  • Mathematics
  • Computer Science

Sudakov's subfields of specialization include:

  • Computational Theory and Mathematics
  • Discrete Mathematics and Combinatorics
  • Geometry and Topology
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Their main research topics are focused on:

  • Limits and Structures in Graph Theory
  • Advanced Graph Theory Research
  • Graph theory and applications
  • Advanced Topology and Set Theory
  • Graph theory and CDMA systems
  • Graph Labeling and Dimension Problems
  • Complexity and Algorithms in Graphs

Benny Sudakov has published extensively in various venues, including:

  • arXiv (Cornell University)
  • Mathematical Proceedings of the Cambridge Philosophical Society
  • COMBINATORICA
  • Journal of Combinatorial Theory Series B
  • Random Structures and Algorithms

Some of their recent papers include:

  • Turán number of bipartite graphs with no _{,} (2020), published in Proceedings of the American Mathematical Society
  • New bounds for Ryser's conjecture and related problems (2022), published in Transactions of the American Mathematical Society Series B
  • Embedding rainbow trees with applications to graph labelling and decomposition (2020), published in Journal of the European Mathematical Society
  • Dense Induced Bipartite Subgraphs in Triangle-Free Graphs (2020), published in COMBINATORICA
  • A proof of Ringel's conjecture (2021), published in Geometric and Functional Analysis

Frequent co-authors working with Sudakov include:

  • István Tomon
  • David Munhá Correia
  • Matija Bucić
  • Oliver Janzer
  • Nemanja Draganić

In recognition of their academic contributions, Sudakov has received several distinctions including:

  • Member of Academia Europaea in 2019
  • Fellow of the American Mathematical Society since 2013
  • Fellow of Alfred P. Sloan Foundation since 2004

Best Publications

  • Finding a large hidden clique in a random graph

    Noga Alon;Michael Krivelevich;Benny Sudakov

  • Pseudo-random Graphs

    Michael Krivelevich;Benny Sudakov

  • The Largest Eigenvalue of Sparse Random Graphs

    Michael Krivelevich;Benny Sudakov

  • Acyclic edge colorings of graphs

    Noga Alon;Benny Sudakov;Ayal Zaks

  • Finding a large hidden clique in a random graph

    Noga Alon;Michael Krivelevich;Benny Sudakov

  • Recent developments in graph Ramsey theory.

    David Conlon;Jacob Fox;Benny Sudakov

  • Local resilience of graphs

    Benny Sudakov;V. H. Vu

  • Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions

    Noga Alon;Michael Krivelevich;Benny Sudakov

  • The size of a hypergraph and its matching number

    Hao Huang;Po-shen Loh;Benny Sudakov

  • Coloring Graphs with Sparse Neighborhoods

    Noga Alon;Michael Krivelevich;Benny Sudakov

  • Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels

    Noga Alon;Peter Frankl;Hao Huang;Vojtech Rödl

  • Random regular graphs of high degree

    Michael Krivelevich;Benny Sudakov;Van H. Vu;Nicholas C. Wormald

  • Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors

    Boaz Barak;Guy Kindler;Ronen Shaltiel;Benny Sudakov

  • Dependent random choice

    Jacob Fox;Benny Sudakov

  • On the asymmetry of random regular graphs and random graphs

    Jeong Han Kim;Benny Sudakov;Van H. Vu

  • Density theorems for bipartite graphs and related Ramsey-type results

    Jacob Fox;Benny Sudakov

  • AN APPROXIMATE VERSION OF SIDORENKO'S CONJECTURE

    David Conlon;Jacob Fox;Benny Sudakov

  • The Turán Number Of The Fano Plane

    Peter Keevash;Benny Sudakov

  • Hypergraph Ramsey numbers

    David Conlon;Jacob Fox;Benny Sudakov

  • The phase transition in random graphs: A simple proof

    Michael Krivelevich;Benny Sudakov

  • Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels

    Noga Alon;Peter Frankl;Hao Huang;Vojtech Rodl

Frequent Co-Authors

Michael Krivelevich
Michael Krivelevich Tel Aviv University
Jacob Fox
Jacob Fox Stanford University
Noga Alon
Noga Alon Tel Aviv University
Eyal Lubetzky
Eyal Lubetzky Courant Institute of Mathematical Sciences
Van Vu
Van Vu Yale University
Alan Frieze
Alan Frieze Carnegie Mellon University
Jan Vondrák
Jan Vondrák Stanford University
Uri Zwick
Uri Zwick Tel Aviv University
János Pach
János Pach Alfréd Rényi Institute of Mathematics
Nicholas C. Wormald
Nicholas C. Wormald Monash University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, exploring complementary online degrees can open up diverse career opportunities. Many find that combining a strong math background with business acumen enhances their professional prospects. For those interested in advancing into leadership roles, programs like mba programs easy to get into provide accessible pathways to gain essential managerial skills without stringent entry barriers.

Flexibility is key for working professionals, and the easiest online mba options offer valuable alternatives to traditional full-time studies, enabling you to balance work and learning effectively. For those aiming to deepen expertise in business leadership, affordable online PhD options like the dba online programs deliver an advanced understanding of organizational dynamics.

Mathematics graduates with an interest in finance can also explore the online masters in finance, which blend analytical skills with financial theory, preparing students for roles in investment banking, risk management, and financial analysis. These related degrees not only broaden career paths but also enhance earning potential and job security.

Best Scientists Citing Benny Sudakov

Trending Scientists