Michael Krivelevich

7.1k total citations
203 papers, 3.0k citations indexed

About

Michael Krivelevich is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Michael Krivelevich has authored 203 papers receiving a total of 3.0k indexed citations (citations by other indexed papers that have themselves been cited), including 152 papers in Computational Theory and Mathematics, 146 papers in Discrete Mathematics and Combinatorics and 70 papers in Geometry and Topology. Recurrent topics in Michael Krivelevich's work include Limits and Structures in Graph Theory (144 papers), Advanced Graph Theory Research (129 papers) and Graph theory and applications (58 papers). Michael Krivelevich is often cited by papers focused on Limits and Structures in Graph Theory (144 papers), Advanced Graph Theory Research (129 papers) and Graph theory and applications (58 papers). Michael Krivelevich collaborates with scholars based in Israel, United States and Switzerland. Michael Krivelevich's co-authors include Benny Sudakov, Noga Alon, Alan Frieze, Márió Szegedy, Raphael Yuster, Tibor Szabó, Dan Hefetz, Eldar Fischer, Dana Ron and Simon Litsyn and has published in prestigious journals such as IEEE Transactions on Information Theory, Transactions of the American Mathematical Society and SIAM Journal on Computing.

In The Last Decade

Michael Krivelevich

192 papers receiving 2.7k citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Michael Krivelevich 2.2k 1.5k 746 571 501 203 3.0k
Benny Sudakov 2.6k 1.2× 2.4k 1.6× 1.4k 1.9× 351 0.6× 257 0.5× 276 3.5k
Jaroslav Nešetřil 3.2k 1.5× 1.8k 1.2× 1.4k 1.8× 435 0.8× 625 1.2× 257 4.1k
Nicholas Wormald 1.4k 0.7× 1.2k 0.8× 709 1.0× 376 0.7× 472 0.9× 145 3.0k
Colin McDiarmid 1.4k 0.6× 773 0.5× 353 0.5× 258 0.5× 367 0.7× 150 2.3k
Zoltán Füredi 2.3k 1.1× 2.3k 1.5× 1.4k 1.9× 505 0.9× 373 0.7× 200 4.0k
Gil Kalai 1.3k 0.6× 833 0.5× 536 0.7× 515 0.9× 248 0.5× 77 2.6k
Vera T. Sós 1.4k 0.6× 1.3k 0.8× 954 1.3× 236 0.4× 137 0.3× 62 2.2k
Andrzej Ruciński 2.2k 1.0× 2.5k 1.6× 1.5k 2.0× 324 0.6× 429 0.9× 143 3.9k
Thomas Zasĺavsky 1.2k 0.6× 913 0.6× 833 1.1× 160 0.3× 202 0.4× 92 2.2k
József Balogh 1.1k 0.5× 1.0k 0.7× 580 0.8× 96 0.2× 531 1.1× 149 2.1k

Countries citing papers authored by Michael Krivelevich

Since Specialization
Citations

This map shows the geographic impact of Michael Krivelevich's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Krivelevich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Krivelevich more than expected).

Fields of papers citing papers by Michael Krivelevich

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Krivelevich. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Krivelevich. The network helps show where Michael Krivelevich may publish in the future.

Co-authorship network of co-authors of Michael Krivelevich

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Krivelevich. A scholar is included among the top collaborators of Michael Krivelevich based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Krivelevich. Michael Krivelevich is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kang, Mihyun, et al.. (2024). Percolation on High‐Dimensional Product Graphs. Random Structures and Algorithms. 66(1). 1 indexed citations
2.
Krivelevich, Michael, Robert Morris, Oliver Riordan, & Angelika Steger. (2023). Combinatorics, Probability and Computing. Oberwolfach Reports. 19(2). 1165–1237.
3.
Krivelevich, Michael, et al.. (2023). On vertex Ramsey graphs with forbidden subgraphs. Discrete Mathematics. 347(3). 113806–113806. 1 indexed citations
4.
Alon, Noga, Michael Krivelevich, & Wojciech Samotij. (2023). Largest subgraph from a hereditary property in a random graph. Discrete Mathematics. 346(9). 113480–113480.
5.
Krivelevich, Michael, et al.. (2022). Rolling backwards can move you forward: On embedding problems in sparse expanders. Transactions of the American Mathematical Society. 375(7). 5195–5216. 8 indexed citations
6.
Krivelevich, Michael, et al.. (2021). Color‐biased Hamilton cycles in random graphs. Random Structures and Algorithms. 60(3). 289–307. 6 indexed citations
7.
Krivelevich, Michael, Oliver Riordan, & Angelika Steger. (2020). Combinatorics, Probability and Computing. Oberwolfach Reports. 16(2). 1113–1189.
8.
Coja‐Oghlan, Amin, Uriel Feige, Michael Krivelevich, & Daniel Reichman. (2015). Contagious sets in expanders. Symposium on Discrete Algorithms. 1953–1987. 12 indexed citations
9.
Krivelevich, Michael, Choongbum Lee, & Benny Sudakov. (2014). Robust Hamiltonicity of Dirac graphs. Transactions of the American Mathematical Society. 366(6). 3095–3130. 22 indexed citations
10.
Ferber, Asaf, et al.. (2011). Hitting time results for Maker‐Breaker games. Random Structures and Algorithms. 41(1). 23–46. 16 indexed citations
11.
Frieze, Alan, Michael Krivelevich, & Po‐Shen Loh. (2011). Packing tight Hamilton cycles in 3-uniform hypergraphs. Symposium on Discrete Algorithms. 913–932. 2 indexed citations
12.
Kaufman, Tali, et al.. (2010). Comparing the strength of query types in property testing: the case of testing k-colorability. Springer eBooks. 253–259. 1 indexed citations
13.
Coja‐Oghlan, Amin, Uriel Feige, Alan Frieze, Michael Krivelevich, & Dan Vilenchik. (2009). On smoothed k-CNF formulas and the Walksat algorithm. Symposium on Discrete Algorithms. 451–460. 9 indexed citations
14.
Krivelevich, Michael & Dan Vilenchik. (2006). Solving random satisfiable 3CNF formulas in expected polynomial time. Symposium on Discrete Algorithms. 454–463. 12 indexed citations
15.
Alon, Noga, Tali Kaufman, Michael Krivelevich, & Dana Ron. (2006). Testing triangle-freeness in general graphs. Symposium on Discrete Algorithms. 279–288. 12 indexed citations
16.
Krivelevich, Michael, Zeev Nutov, & Raphael Yuster. (2005). Approximation algorithms for cycle packing problems. Symposium on Discrete Algorithms. 556–561. 8 indexed citations
17.
Flaxman, Abraham D., Alan Frieze, & Michael Krivelevich. (2005). On the random 2-stage minimum spanning tree. Symposium on Discrete Algorithms. 919–926. 5 indexed citations
18.
Krivelevich, Michael, et al.. (2001). Approximating coloring and maximum independent sets in 3-uniform hypergraphs. Symposium on Discrete Algorithms. 327–328. 6 indexed citations
19.
Krivelevich, Michael & Benny Sudakov. (1998). Approximate Coloring of Uniform Hypergraphs.. European Symposium on Algorithms. 1461(1). 477–489. 9 indexed citations
20.
Alon, Noga, Michael Krivelevich, & Benny Sudakov. (1998). Finding a large hidden clique in a random graph. Symposium on Discrete Algorithms. 594–598. 60 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Benny Sudakov Breakdown of academic impact, for papers by Jaroslav Nešetřil Breakdown of academic impact, for papers by Nicholas Wormald Breakdown of academic impact, for papers by Colin McDiarmid Breakdown of academic impact, for papers by Zoltán Füredi Breakdown of academic impact, for papers by Gil Kalai Breakdown of academic impact, for papers by Vera T. Sós Breakdown of academic impact, for papers by Andrzej Ruciński Breakdown of academic impact, for papers by Thomas Zasĺavsky Breakdown of academic impact, for papers by József Balogh
Rankless by CCL
2026