World's Best Scientists 2026 revealed!
Michael Krivelevich

Michael Krivelevich

Award Badge
Mathematics
Israel
2026

D-Index & Metrics

Computer Science

D-Index
57
Citations
10925
World Ranking
3891
National Ranking
61

Mathematics

D-Index
57
Citations
10943
World Ranking
700
National Ranking
12

Research.com Recognitions

  • 2026 - Research.com Mathematics in Israel Leader Award
  • 2025 - Research.com Mathematics in Israel Leader Award
  • 2017 - Fellow of the American Mathematical Society For contributions to extremal and probabilistic combinatorics.

Overview

Michael Krivelevich is affiliated with Tel Aviv University in Israel and has an extensive research portfolio primarily in the fields of Mathematics and Computer Science. Their work spans multiple subfields, including Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Mathematical Physics, Geometry and Topology, and Statistics and Probability.

The main topics of their research focus include:

  • Limits and Structures in Graph Theory
  • Advanced Graph Theory Research
  • Stochastic processes and statistical mechanics
  • Graph theory and applications
  • Markov Chains and Monte Carlo Methods
  • Complex Network Analysis Techniques
  • Theoretical and Computational Physics

Krivelevich's recent scholarly contributions are represented by papers published in prominent journals such as Transactions of the American Mathematical Society, Journal of Graph Theory, Advances in Mathematics, Random Structures and Algorithms, and SIAM Journal on Discrete Mathematics. Notable publications include:

  • "Rolling backwards can move you forward: On embedding problems in sparse expanders," 2022, Transactions of the American Mathematical Society
  • "Divisible subdivisions," 2021, Journal of Graph Theory
  • "Every graph contains a linearly sized induced subgraph with all degrees odd," 2022, Advances in Mathematics
  • "Color-biased Hamilton cycles in random graphs," 2021, Random Structures and Algorithms
  • "Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs," 2022, SIAM Journal on Discrete Mathematics

Their work has been disseminated through frequent publication in venues such as:

  • arXiv (Cornell University)
  • Random Structures and Algorithms
  • Journal of Graph Theory
  • Combinatorics Probability Computing
  • COMBINATORICA

Collaborations form an important aspect of Krivelevich's research, with frequent co-authors including Sahar Diskin, Joshua Erde, Peleg Michaeli, Mihyun Kang, and Nemanja Draganić.

In 2017, Krivelevich was recognized as a Fellow of the American Mathematical Society for contributions to extremal and probabilistic combinatorics.

Best Publications

  • Finding a large hidden clique in a random graph

    Noga Alon;Michael Krivelevich;Benny Sudakov

  • Efficient Testing of Large Graphs

    Noga Alon;Eldar Fischer;Michael Krivelevich;Mario Szegedy

  • Pseudo-random Graphs

    Michael Krivelevich;Benny Sudakov

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

    Unknown

  • The Largest Eigenvalue of Sparse Random Graphs

    Michael Krivelevich;Benny Sudakov

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

    Michael Krivelevich;Raphael Yuster

  • Finding a large hidden clique in a random graph

    Noga Alon;Michael Krivelevich;Benny Sudakov

  • Regular Languages are Testable with a Constant Number of Queries

    Noga Alon;Michael Krivelevich;Ilan Newman;Mario Szegedy

  • On the concentration of eigenvalues of random symmetric matrices

    Noga Alon;Michael Krivelevich;Van H. Vu

  • Testing Reed-Muller codes

    N. Alon;T. Kaufman;M. Krivelevich;S. Litsyn

  • Bi-arc graphs and the complexity of list homomorphisms

    Tomas Feder;Pavol Hell;Jing Huang

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

    Noga Alon;Michael Krivelevich;Benny Sudakov

  • Coloring Graphs with Sparse Neighborhoods

    Noga Alon;Michael Krivelevich;Benny Sudakov

  • Random regular graphs of high degree

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

  • The concentration of the chromatic number of random graphs

    Noga Mordechai Alon;Michael Krivelevich

  • Testing k -colorability

    Noga Alon;Michael Krivelevich

  • Testing Low-Degree Polynomials over GF (2)

    Noga Alon;Tali Kaufman;Michael Krivelevich;Simon Litsyn

  • The critical bias for the Hamiltonicity game is $(1+o(1))n/\ln n$

    Michael Krivelevich

  • Tight Bounds for Testing Bipartiteness in General Graphs

    Tali Kaufman;Michael Krivelevich;Dana Ron

  • Efficient testing of large graphs

    N. Alon;M. Krivelevich;E. Fischer;M. Szegedy

  • Positional Games

    Dan Hefetz;Miloš Stojaković;Michael Krivelevich

  • Two-coloring random hypergraphs

    Dimitris Achlioptas;Jeong Han Kim;Michael Krivelevich;Prasad Tetali

Frequent Co-Authors

Benny Sudakov
Benny Sudakov ETH Zurich
Noga Alon
Noga Alon Tel Aviv University
Alan Frieze
Alan Frieze Carnegie Mellon University
Eyal Lubetzky
Eyal Lubetzky Courant Institute of Mathematical Sciences
Simon Litsyn
Simon Litsyn Tel Aviv University
Dana Ron
Dana Ron Tel Aviv University
Van Vu
Van Vu Yale University
Gregory Gutin
Gregory Gutin Royal Holloway University of London
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Fedor V. Fomin
Fedor V. Fomin University of Bergen

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

Pursuing a degree in Mathematics opens doors to numerous interdisciplinary career paths, many of which can be supplemented with specialized online programs. For those interested in leadership roles, online dba programs offer affordable options to gain advanced business administration skills while leveraging strong analytical backgrounds.

Finance professionals with a math foundation can enhance their expertise through masters in finance online programs, which provide flexibility and cost-effectiveness without compromising on quality. These programs prepare graduates for high-demand roles in financial analysis, risk management, and quantitative modeling.

For those aiming to combine technical knowledge with broader managerial skills, accelerated mba programs online offer a streamlined path to leadership positions. These programs cater to professionals seeking rapid advancement in competitive business environments.

Additionally, individuals interested in marketing analytics can consider the cheapest online marketing degree options. These affordable programs focus on data-driven marketing strategies, enabling graduates to harness their mathematical skills in dynamic marketing roles.

Best Scientists Citing Michael Krivelevich

Trending Scientists