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.
