- Home
- Best Scientists - Mathematics
- Michael Krivelevich

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
51
Citations
8,676
320
World Ranking
753
National Ranking
12

Computer Science
D-index
51
Citations
8,663
318
World Ranking
3555
National Ranking
65

2017 - Fellow of the American Mathematical Society For contributions to extremal and probabilistic combinatorics.

- Combinatorics
- Discrete mathematics
- Graph theory

Michael Krivelevich mainly investigates Combinatorics, Discrete mathematics, Graph, Random graph and Random regular graph. He performs multidisciplinary studies into Combinatorics and High probability in his work. His research links Almost surely with Discrete mathematics.

In general Graph, his work in Graph property is often linked to Special case linking many areas of study. His work investigates the relationship between Random graph and topics such as Hamiltonian path that intersect with problems in Disjoint sets. His Random regular graph research integrates issues from Triangle-free graph and Pancyclic graph.

- Efficient Testing of Large Graphs (230 citations)
- Finding a large hidden clique in a random graph (217 citations)
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree (193 citations)

His primary areas of investigation include Combinatorics, Discrete mathematics, Random graph, Graph and Random regular graph. His Combinatorics and Vertex, Degree, Binary logarithm, Hamiltonian path and Hypergraph investigations all form part of his Combinatorics research activities. His Graph power, Time complexity, Path graph, Factor-critical graph and Line graph investigations are all subjects of Discrete mathematics research.

Michael Krivelevich combines subjects such as Almost surely, Graph property and Constant with his study of Random graph. His Graph research includes elements of Graph theory, Pseudorandom number generator, Existential quantification and Conjecture. He usually deals with Random regular graph and limits it to topics linked to Indifference graph and Pathwidth.

- Combinatorics (93.54%)
- Discrete mathematics (53.23%)
- Random graph (39.53%)

- Combinatorics (93.54%)
- Random graph (39.53%)
- Graph (27.91%)

The scientist’s investigation covers issues in Combinatorics, Random graph, Graph, Vertex and Bounded function. He merges many fields, such as Combinatorics and Omega, in his writings. His Random graph research entails a greater understanding of Discrete mathematics.

His work on Chordal graph as part of general Discrete mathematics study is frequently linked to General method, therefore connecting diverse disciplines of science. His Graph study combines topics from a wide range of disciplines, such as Graph theory and Absolute constant. His Vertex research incorporates elements of Maximal independent set, Embedding, Independent set, Disjoint sets and Null graph.

- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs (37 citations)
- Counting and packing Hamilton cycles in dense graphs and oriented graphs (26 citations)
- Contagious sets in random graphs (22 citations)

- Combinatorics
- Graph theory
- Discrete mathematics

Michael Krivelevich spends much of his time researching Combinatorics, Random graph, Graph, Vertex and Discrete mathematics. Michael Krivelevich undertakes multidisciplinary investigations into Combinatorics and Bounded function in his work. His Random graph research is multidisciplinary, incorporating perspectives in Ramsey theory, Degree and Constant.

His research integrates issues of Almost surely, Smoothed analysis and Spanning tree in his study of Degree. As part of one scientific family, he deals mainly with the area of Graph, narrowing it down to issues related to the Conjecture, and often Chordal graph, Absolute constant and Symmetrization. The study incorporates disciplines such as Disjoint sets, Hitting time and Null graph in addition to Vertex.

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)**

447 Citations

Efficient Testing of Large Graphs

Noga Alon;Eldar Fischer;Michael Krivelevich;Mario Szegedy.

Combinatorica **(2000)**

426 Citations

Pseudo-random Graphs

Michael Krivelevich;Benny Sudakov.

arXiv: Combinatorics **(2006)**

406 Citations

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

Michael Krivelevich;Raphael Yuster.

Journal of Graph Theory **(2010)**

236 Citations

Finding a large hidden clique in a random graph

Noga Alon;Michael Krivelevich;Benny Sudakov.

symposium on discrete algorithms **(1998)**

196 Citations

The Largest Eigenvalue of Sparse Random Graphs

Michael Krivelevich;Benny Sudakov.

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

191 Citations

Regular Languages are Testable with a Constant Number of Queries

Noga Alon;Michael Krivelevich;Ilan Newman;Mario Szegedy.

SIAM Journal on Computing **(2001)**

187 Citations

On the concentration of eigenvalues of random symmetric matrices

Noga Alon;Michael Krivelevich;Van H. Vu.

Israel Journal of Mathematics **(2002)**

166 Citations

Testing Reed-Muller codes

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

IEEE Transactions on Information Theory **(2005)**

151 Citations

On two Hamilton cycle problems in random graphs

Alan Frieze;Michael Krivelevich.

Israel Journal of Mathematics **(2008)**

133 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:

ETH Zurich

Tel Aviv University

Carnegie Mellon University

Tel Aviv University

Tel Aviv University

Yale University

Royal Holloway University of London

Institute of Mathematical Sciences

University of Bergen

Rutgers, The State University of New Jersey

Lawrence Livermore National Laboratory

University of Virginia

Friedrich Schiller University Jena

Aristotle University of Thessaloniki

Ruđer Bošković Institute

Lawrence Berkeley National Laboratory

Vanderbilt University

KU Leuven

University of South Florida

National Institutes of Health

Harvard University

Columbia University

University of Western Ontario

Yale University

University of Nottingham

Sorbonne University

Something went wrong. Please try again later.