H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 49 Citations 8,506 238 World Ranking 3073 National Ranking 53
Mathematics D-index 49 Citations 8,512 242 World Ranking 612 National Ranking 11

Research.com Recognitions

Awards & Achievements

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

Overview

What is he best known for?

The fields of study he is best known for:

  • 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.

His most cited work include:

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

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

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

What were the highlights of his more recent work (between 2016-2021)?

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

In recent papers he was focusing on the following fields of study:

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.

Between 2016 and 2021, his most popular works were:

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

In his most recent research, the most cited papers focused on:

  • 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.

Best Publications

Finding a large hidden clique in a random graph

Noga Alon;Michael Krivelevich;Benny Sudakov.
Random Structures and Algorithms (1998)

402 Citations

Efficient Testing of Large Graphs

Noga Alon;Eldar Fischer;Michael Krivelevich;Mario Szegedy.
Combinatorica (2000)

392 Citations

Pseudo-random Graphs

Michael Krivelevich;Benny Sudakov.
arXiv: Combinatorics (2006)

242 Citations

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

Michael Krivelevich;Raphael Yuster.
Journal of Graph Theory (2010)

231 Citations

Regular Languages are Testable with a Constant Number of Queries

Noga Alon;Michael Krivelevich;Ilan Newman;Mario Szegedy.
SIAM Journal on Computing (2001)

178 Citations

The Largest Eigenvalue of Sparse Random Graphs

Michael Krivelevich;Benny Sudakov.
Combinatorics, Probability & Computing (2003)

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

145 Citations

On two Hamilton cycle problems in random graphs

Alan Frieze;Michael Krivelevich.
Israel Journal of Mathematics (2008)

133 Citations

Testing Low-Degree Polynomials over GF (2)

Noga Alon;Tali Kaufman;Michael Krivelevich;Simon Litsyn.
randomization and approximation techniques in computer science (2003)

130 Citations

Editorial Boards

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Michael Krivelevich

Benny Sudakov

Benny Sudakov

ETH Zurich

Publications: 141

Noga Alon

Noga Alon

Tel Aviv University

Publications: 103

Deryk Osthus

Deryk Osthus

University of Birmingham

Publications: 68

Daniela Kühn

Daniela Kühn

University of Birmingham

Publications: 61

Jacob Fox

Jacob Fox

Stanford University

Publications: 55

Alan Frieze

Alan Frieze

Carnegie Mellon University

Publications: 55

Yoshiharu Kohayakawa

Yoshiharu Kohayakawa

Universidade de São Paulo

Publications: 52

Dana Ron

Dana Ron

Tel Aviv University

Publications: 49

Gregory Gutin

Gregory Gutin

Royal Holloway University of London

Publications: 41

Oded Goldreich

Oded Goldreich

Weizmann Institute of Science

Publications: 40

Madhu Sudan

Madhu Sudan

Harvard University

Publications: 38

Uriel Feige

Uriel Feige

Weizmann Institute of Science

Publications: 33

Van Vu

Van Vu

Yale University

Publications: 31

József Balogh

József Balogh

University of Illinois at Urbana-Champaign

Publications: 27

Anders Yeo

Anders Yeo

University of Johannesburg

Publications: 27

Béla Bollobás

Béla Bollobás

University of Memphis

Publications: 24

Something went wrong. Please try again later.