Concepedia

Benny Sudakov

BS

Statistics

Publications

168

Citations

6.5K

H-Index

43

Active since

1998

Affiliations

Princeton University(Current)

Tel Aviv University

University of California, Los Angeles

Institute for Advanced Study

Benny Sudakov is an author at Princeton University specializing in graph theory, discrete mathematics, and engineering.

Top concepts

Discrete MathematicsGraph TheoryEngineeringCombinatorial OptimizationComputational ComplexityNetwork ScienceNetwork AnalysisEducationProbabilityComputer Science

Publications per year

1998–2023

168

Publications

168

Finding a large hidden clique in a random graph

Noga Alon, Michael Krivelevich, Benny Sudakov · Random Structures and Algorithms · 1998 · 265 citations

Hidden Clique, Network Science, Graph Theory +15

The Largest Eigenvalue of Sparse Random Graphs

Michael Krivelevich, Benny Sudakov · Combinatorics Probability Computing · 2003 · 199 citations · Full text

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

Noga Alon, Michael Krivelevich, Benny Sudakov · Combinatorics Probability Computing · 2003 · 144 citations

Graph Minor, Graph Theory, Algebraic Graph Theory +9

The Size of a Hypergraph and its Matching Number

Hao Huang, Po‐Shen Loh, Benny Sudakov · Combinatorics Probability Computing · 2012 · 137 citations · Full text

Hypergraph Turán Problem, Geometric Graph Theory, Network Science +11

Acyclic edge colorings of graphs

Noga Alon, Benny Sudakov, Ayal Zaks · Journal of Graph Theory · 2001 · 128 citations

Geometric Graph Theory, Proper Coloring, Graph Theory +7

1–5 of 168