Michael Krivelevich

Efficient Testing of Large Graphs

Noga Alon, Eldar Fischer, Michael Krivelevich et al. · COMBINATORICA · 2000 · 290 citations

Cluster Computing, Efficient Testing, Engineering +10

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

The rainbow connection of a graph is (at most) reciprocal to its minimum degree

Michael Krivelevich, Raphael Yuster · Journal of Graph Theory · 2009 · 173 citations

Geometric Graph Theory, Edge‐colored Graph G, Graph Theory +13

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