- Home
- Best Scientists - Mathematics
- Benny Sudakov

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
50
Citations
8,748
325
World Ranking
575
National Ranking
14

Engineering and Technology
D-index
50
Citations
8,735
322
World Ranking
1552
National Ranking
29

2019 - Member of Academia Europaea

2013 - Fellow of the American Mathematical Society

2004 - Fellow of Alfred P. Sloan Foundation

- Combinatorics
- Discrete mathematics
- Graph theory

Benny Sudakov mainly investigates Combinatorics, Discrete mathematics, Graph, Random regular graph and Random graph. His Combinatorics study frequently draws connections to adjacent fields such as Pseudorandom number generator. His research related to Graph power, Conjecture, Split graph, Bipartite graph and Bound graph might be considered part of Discrete mathematics.

His work deals with themes such as Binary logarithm and Constant factor, which intersect with Graph. His study explores the link between Random regular graph and topics such as Triangle-free graph that cross with problems in Strongly regular graph and Maximal independent set. His work deals with themes such as Extremal graph theory, Line graph and Regular graph, which intersect with Random graph.

- Finding a large hidden clique in a random graph (217 citations)
- Pseudo-random Graphs (160 citations)
- The Largest Eigenvalue of Sparse Random Graphs (135 citations)

Benny Sudakov mainly focuses on Combinatorics, Discrete mathematics, Graph, Conjecture and Random graph. His study in Complete graph, Ramsey's theorem, Hypergraph, Bipartite graph and Vertex is carried out as part of his Combinatorics studies. His Discrete mathematics study is mostly concerned with Random regular graph, Graph power, Complement graph, Bound graph and Factor-critical graph.

His study in the field of Vertex is also linked to topics like Omega. The study incorporates disciplines such as Disjoint sets, Independence number, Edge and Tournament in addition to Conjecture. His Random graph study incorporates themes from Almost surely, Graph property, Hamiltonian path and Degree.

- Combinatorics (100.00%)
- Discrete mathematics (47.86%)
- Graph (33.33%)

- Combinatorics (100.00%)
- Conjecture (27.75%)
- Graph (33.33%)

His primary scientific interests are in Combinatorics, Conjecture, Graph, Bipartite graph and Random graph. His Conjecture research incorporates themes from Disjoint sets, Lemma and Complete graph. His Graph study combines topics from a wide range of disciplines, such as Sublinear function and Partition.

His study looks at the intersection of Bipartite graph and topics like Turán number with Rank. Random graph is a subfield of Discrete mathematics that Benny Sudakov explores. His research on Discrete mathematics often connects related areas such as Graph.

- Decompositions into spanning rainbow structures (24 citations)
- A counterexample to Stein's Equi-n-square Conjecture (12 citations)
- An algebraic perspective on integer sparse recovery (12 citations)

- Combinatorics
- Discrete mathematics
- Graph theory

Benny Sudakov focuses on Combinatorics, Conjecture, Graph, Bipartite graph and Ramsey's theorem. Many of his studies on Combinatorics involve topics that are commonly interrelated, such as Discrete mathematics. Benny Sudakov focuses mostly in the field of Conjecture, narrowing it down to topics relating to Disjoint sets and, in certain cases, Matroid and Vector space.

When carried out as part of a general Graph research project, his work on Dense graph is frequently linked to work in Has property, therefore connecting diverse disciplines of study. His study in Bipartite graph is interdisciplinary in nature, drawing from both Log-log plot and Independence number. His Ramsey's theorem research integrates issues from Ramsey theory, Tree, Directed graph and Complete bipartite graph.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Finding a large hidden clique in a random graph

Noga Alon;Michael Krivelevich;Benny Sudakov.

Random Structures and Algorithms **(1998)**

402 Citations

Pseudo-random Graphs

Michael Krivelevich;Benny Sudakov.

arXiv: Combinatorics **(2006)**

242 Citations

Acyclic edge colorings of graphs

Noga Alon;Benny Sudakov;Ayal Zaks.

Journal of Graph Theory **(2001)**

215 Citations

The Largest Eigenvalue of Sparse Random Graphs

Michael Krivelevich;Benny Sudakov.

Combinatorics, Probability & Computing **(2003)**

173 Citations

Local resilience of graphs

Benny Sudakov;V. H. Vu.

Random Structures and Algorithms **(2008)**

142 Citations

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

B. Barak;G. Kindler;R. Shaltiel;B. Sudakov.

symposium on the theory of computing **(2005)**

137 Citations

Random regular graphs of high degree

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

Random Structures and Algorithms **(2001)**

121 Citations

Coloring Graphs with Sparse Neighborhoods

Noga Alon;Michael Krivelevich;Benny Sudakov.

Journal of Combinatorial Theory, Series B **(1999)**

121 Citations

On the asymmetry of random regular graphs and random graphs

Jeong Han Kim;Benny Sudakov;Van H. Vu.

Random Structures and Algorithms **(2002)**

114 Citations

The Turán Number Of The Fano Plane

Peter Keevash;Benny Sudakov.

Combinatorica **(2005)**

109 Citations

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

Contact us

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:

Tel Aviv University

Stanford University

Tel Aviv University

Yale University

Carnegie Mellon University

Stanford University

Tel Aviv University

Alfréd Rényi Institute of Mathematics

Monash University

Tel Aviv University

Something went wrong. Please try again later.