Michael Krivelevich | Academic Influence

Michael Krivelevich's AcademicInfluence.com Rankings

Michael Krivelevich

Mathematics

#2985

World Rank

#4493

Historical Rank

Combinatorics

#50

World Rank

#55

Historical Rank

Graph Theory

#59

World Rank

#66

Historical Rank

Measure Theory

#2200

World Rank

#2646

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Michael Krivelevich's Degrees

PhD Mathematics Tel Aviv University

Why Is Michael Krivelevich Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Michael Krivelevich is a professor with the School of Mathematical Sciences of Tel Aviv University, Israel. Krivelevich received his PhD from Tel Aviv University in 1997 under the supervision of Noga Alon. He has published extensively in combinatorics and adjacent fields and specializes in extremal and probabilistic combinatorics.

(See a Problem?)

Michael Krivelevich's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Finding a large hidden clique in a random graph (1998) (415)
Pseudo-random Graphs (2005) (369)
Efficient Testing of Large Graphs (2000) (360)
The rainbow connection of a graph is (at most) reciprocal to its minimum degree (2010) (227)
The Largest Eigenvalue of Sparse Random Graphs (2001) (185)
On the concentration of eigenvalues of random symmetric matrices (2000) (161)
Regular languages are testable with a constant number of queries (1999) (156)
Coloring Graphs with Sparse Neighborhoods (1999) (132)
Testing Reed-Muller codes (2005) (125)
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions (2003) (119)
The phase transition in random graphs: A simple proof (2012) (119)
Tight Bounds for Testing Bipartiteness in General Graphs (2004) (119)
Random regular graphs of high degree (2001) (117)
Testing Low-Degree Polynomials over GF(2( (2003) (112)
Positional Games (2014) (101)
Sparse pseudo‐random graphs are Hamiltonian (2003) (90)
The concentration of the chromatic number of random graphs (1997) (90)
Testing k-colorability (2002) (89)
Maximum cuts and judicious partitions in graphs without short cycles (2003) (84)
On a conjecture of Tuza about packing and covering of triangles (1995) (79)
Constructive Bounds for a Ramsey-Type Problem (1997) (77)
Variations on cops and robbers (2010) (76)
Algorithms with large domination ratio (2004) (75)
The critical bias for the Hamiltonicity game is $(1+o(1))n/\ln n$ (2009) (74)
On two Hamilton cycle problems in random graphs (2008) (74)
Triangle Factors in Random Graphs (1997) (72)
Bounding Ramsey Numbers through Large Deviation Inequalities (1995) (72)
Testing triangle-freeness in general graphs (2006) (69)
The size Ramsey number of a directed path (2010) (66)
Scalable Secure Storage When Half the System Is Faulty (2000) (65)
Upper bounds on the rate of LDPC codes (2002) (64)
Approximation algorithms and hardness results for cycle packing problems (2007) (63)
Fast winning strategies in Maker-Breaker games (2009) (61)
On packing Hamilton cycles in ?-regular graphs (2005) (60)
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods (2001) (59)
On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs (2011) (57)
List Coloring of Random and Pseudo-Random Graphs (1999) (57)
On smoothed analysis in dense graphs and formulas (2006) (55)
Contagious Sets in Expanders (2013) (54)
Embedding Spanning Trees in Random Graphs (2010) (52)
Optimal Packings of Hamilton Cycles in Sparse Random Graphs (2011) (52)
Resilient Pancyclicity of Random and Pseudorandom Graphs (2009) (51)
Embedding nearly-spanning bounded degree trees (2007) (50)
The chromatic numbers of random hypergraphs (1998) (50)
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time (2002) (49)
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs (2015) (49)
Adding random edges to dense graphs (2004) (49)
Hamiltonicity thresholds in Achlioptas processes (2008) (48)
Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs (2009) (47)
Spanning Directed Trees with Many Leaves (2008) (46)
Approximating coloring and maximum independent sets in 3-uniform hypergraphs (2001) (46)
Hamilton cycles in highly connected and expanding graphs (2006) (46)
On the minimal number of edges in color-critical graphs (1997) (44)
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently (2005) (44)
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs (2015) (43)
Solving random satisfiable 3CNF formulas in expected polynomial time (2006) (41)
Generalized hashing and parent-identifying codes (2003) (39)
HAMILTON CYCLES IN RANDOM GEOMETRIC GRAPHS (2009) (36)
Long Cycles in Locally Expanding Graphs, with Applications (2016) (36)
Planarity, Colorability, and Minor Games (2008) (36)
The emergence of a giant component in random subgraphs of pseudo‐random graphs (2004) (35)
Expanders - how to find them, and what to find in them (2018) (34)
Avoiding small subgraphs in Achlioptas processes (2007) (34)
Approximate coloring of uniform hypergraphs (1998) (34)
Parameterized Algorithms for Directed Maximum Leaf Problems (2007) (33)
Robust Hamiltonicity of Dirac graphs (2012) (33)
Long paths and Hamiltonicity in random graphs (2015) (32)
Sharp thresholds for certain Ramsey properties of random graphs (2000) (31)
Biased Positional Games and Small Hypergraphs with Large Covers (2008) (31)
Hitting time results for Maker‐Breaker games (2010) (31)
Upper bounds on the rate of LDPC codes as a function of minimum distance (2002) (30)
On the random 2‐stage minimum spanning tree (2005) (30)
Packing hamilton cycles in random and pseudo‐random hypergraphs (2010) (30)
Contagious Sets in Random Graphs (2016) (29)
Triangle Factors In Sparse Pseudo-Random Graphs (2004) (29)
Approximate Set Covering in Uniform Hypergraphs (1997) (29)
Coloring complete bipartite graphs from random lists (2005) (28)
Hierarchy Theorems for Property Testing (2009) (28)
On the Number of Hamilton Cycles in Sparse Random Graphs (2012) (28)
Long paths and cycles in random subgraphs of graphs with large minimum degree (2012) (27)
On Rainbow Trees and Cycles (2008) (27)
Packing tight Hamilton cycles in 3‐uniform hypergraphs (2010) (27)
Ks-Free Graphs Without Large Kr-Free Subgraphs (1994) (26)
Two‐coloring random hypergraphs (2002) (26)
Rainbow Hamilton cycles in random graphs and hypergraphs (2015) (26)
Avoider-Enforcer: The Rules of the Game (2009) (26)
Minors in Expanding Graphs (2007) (25)
Smoothed Analysis on Connected Graphs (2013) (25)
Bounds on distance distributions in codes of known size (2004) (24)
Long cycles in subgraphs of (pseudo)random directed graphs (2010) (24)
On the Edge Distribution in Triangle-free Graphs (1995) (24)
A sharp threshold for the Hamilton cycle Maker–Breaker game (2009) (24)
Coloring Random Graphs — an Algorithmic Perspective (2002) (24)
On a theorem of lovász on covers inr-partite hypergraphs (1996) (24)
testing of large graphs (2000) (24)
Hamilton cycles in random subgraphs of pseudo-random graphs (2002) (23)
Better Algorithms and Bounds for Directed Maximum Leaf Problems (2007) (23)
Ramsey games with giants (2009) (22)
Induced subgraphs of prescribed size (2003) (22)
Longest cycles in sparse random digraphs (2011) (22)
Expanders Are Universal for the Class of All Spanning Trees (2011) (22)
Approximation algorithms for cycle packing problems (2005) (21)
Choosability in Random Hypergraphs (2001) (21)
On the probability of independent sets in random graphs (2003) (21)
Fast Strategies In Maker–Breaker Games Played on Random Boards (2012) (21)
Finding and Using Expanders in Locally Sparse Graphs (2017) (21)
MaxCut in ${\bm H)$-Free Graphs (2005) (21)
Sharp threshold for the appearance of certain spanning trees in random graphs (2012) (21)
Generating random graphs in biased Maker‐Breaker games (2013) (20)
A note on regular Ramsey graphs (2008) (20)
The isoperimetric constant of the random graph process (2005) (20)
Large Subgraphs without Short Cycles (2014) (20)
On smoothed k-CNF formulas and the Walksat algorithm (2009) (19)
Covering codes with improved density (2003) (19)
Manipulative Waiters with Probabilistic Intuition (2014) (19)
A Lower Bound on the Density of Sphere Packings via Graph Theory (2004) (19)
The choice number of random bipartite graphs (1998) (19)
Semirandom Models as Benchmarks for Coloring Algorithms (2006) (19)
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs (2015) (18)
Comparing the strength of query types in property testing: the case of testing k-colorability (2008) (18)
Global Maker-Breaker games on sparse graphs (2011) (17)
Counting and packing Hamilton cycles in dense graphs and oriented graphs (2012) (17)
Finding Hamilton cycles in random graphs with few queries (2015) (17)
On the Number of Hamilton Cycles in Pseudo-Random Graphs (2011) (17)
Biased games on random boards (2012) (17)
Perfect fractional matchings in random hypergraphs (1996) (17)
Avoider-Enforcer games (2007) (17)
On the Non-Planarity of a Random Subgraph (2012) (15)
Why almost all satisfiable $k$-CNF formulas are easy (2007) (15)
The logic of random regular graphs (2010) (15)
2 Proof of Theorem 1 (1997) (15)
On k-saturated graphs with restrictions on the degrees (1996) (15)
Waiter-Client and Client-Waiter planarity, colorability and minor games (2014) (15)
Colouring powers of cycles from random lists (2004) (15)
Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213] (2007) (15)
On the asymptotic value of the choice number of complete multi‐partite graphs (2004) (14)
Walker-Breaker Games (2014) (14)
Cores of random graphs are born Hamiltonian (2013) (14)
The Choice Number of Dense Random Graphs (2000) (14)
Very fast construction of bounded-degree spanning graphs via the semi-random graph process (2019) (14)
Cycle Lengths in Expanding Graphs (2019) (14)
The Game of JumbleG (2005) (13)
Some Remarks on Rainbow Connectivity (2015) (13)
Why almost all k-CNF formulas are easy (2007) (13)
The Strong Chromatic Index of Random Graphs (2005) (12)
Sparse pseudo-random graphs are Hamiltonian (2003) (12)
E cient testing of large graphs (2007) (12)
The random k‐matching‐free process (2017) (12)
Edge-statistics on large graphs (2018) (12)
Why Almost All k -Colorable Graphs Are Easy (2007) (12)
Asymptotics in percolation on high‐girth expanders (2018) (12)
Two-coloring random hypergraphs (2002) (12)
A Sharp Threshold for Network Reliability (2002) (12)
Deciding k-colorability in expected polynomial time (2002) (12)
Divisible subdivisions (2020) (11)
Why Almost All k-Colorable Graphs Are Easy to Color (2010) (11)
Large Nearly Regular Induced Subgraphs (2007) (11)
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time (2000) (11)
Elegantly Colored Paths and Cycles in Edge Colored Random Graphs (2014) (11)
An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs (1997) (11)
On the Random Satisfiable Process (2008) (11)
Finding paths in sparse random graphs requires many queries (2015) (11)
Subgraphs with a large cochromatic number (1997) (11)
On saturation games (2014) (10)
Equitable coloring of random graphs (2009) (10)
On the random 2-stage minimum spanning tree (2006) (10)
Color‐biased Hamilton cycles in random graphs (2020) (10)
The Phase Transition in Site Percolation on Pseudo-Random Graphs (2014) (10)
Fast Winning Strategies in Avoider-Enforcer Games (2008) (10)
The Number of f-Matchings in Almost Every Tree is a Zero Residue (2010) (10)
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence (2007) (10)
Fast embedding of spanning trees in biased Maker-Breaker games (2010) (10)
Compatible Hamilton cycles in Dirac graphs (2014) (10)
A Construction of Almost Steiner Systems (2013) (9)
Rolling backwards can move you forward: on embedding problems in sparse expanders (2020) (9)
On covering expander graphs by hamilton cycles (2011) (9)
Random-Player Maker-Breaker games (2015) (9)
Discrepancy Games (2005) (9)
Coloring Random Graphs (1998) (9)
Compatible Hamilton cycles in random graphs (2014) (9)
Winning Fast in Sparse Graph Construction Games (2008) (9)
Offline thresholds for Ramsey‐type games on random graphs (2010) (9)
Random Graphs, Geometry and Asymptotic Structure (2016) (9)
Random Graph's Hamiltonicity is Strongly Tied to its Minimum Degree (2018) (9)
Complete Minors in Graphs Without Sparse Cuts (2018) (8)
Counting and packing Hamilton -cycles in dense hypergraphs (2014) (8)
Decomposing Random Graphs into Few Cycles and Edges (2014) (8)
Every graph contains a linearly sized induced subgraph with all degrees odd (2020) (8)
Client-Waiter Games on Complete and Random Graphs (2016) (8)
The Genus of the Erdös-Rényi Random Graph and the Fragile Genus Property (2018) (8)
Bart-Moe games, JumbleG and discrepancy (2007) (8)
Finding a Hamilton cycle fast on average using rotations and extensions (2019) (8)
Regular induced subgraphs of a random Graph (2008) (8)
The size‐Ramsey number of short subdivisions (2020) (8)
Approximate Coloring of Uniform Hypergraphs (Extended Abstract) (1998) (7)
Creating Small Subgraphs in Achlioptas Processes With Growing Parameter (2012) (7)
Packing Hamilton Cycles Online (2016) (7)
Random regular graphs of non-constant degree: Concentration of the chromatic number (2005) (7)
Long paths and cycles in random subgraphs of H-free graphs (2013) (7)
Clique coloring of dense random graphs (2016) (7)
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence (2010) (6)
Goldberg's conjecture is true for random multigraphs (2018) (6)
Large complete minors in random subgraphs (2020) (6)
Cycle lengths in sparse random graphs (2020) (6)
Some Remarks on Rainbow Connectivity (2015) (6)
Greedy Maximal Independent Sets via Local Limits (2019) (6)
Packing Tree Factors in Random and Pseudo-random Graphs (2013) (6)
Expansion in supercritical random subgraphs of the hypercube and its consequences (2021) (6)
Almost universal graphs (2006) (6)
Sparse Graphs Usually Have Exponentially Many Optimal Colorings (2002) (6)
Playing to Retain the Advantage (2009) (5)
Small Sample Spaces Cannot Fool Low Degree Polynomials (2008) (5)
Vertex percolation on expander graphs (2007) (5)
Perfectly Balanced Partitions of Smoothed Graphs (2009) (5)
Biased orientation games (2011) (5)
Discrepancies of spanning trees and Hamilton cycles (2020) (5)
On k -saturated graphs with restrictions on the degrees (1996) (5)
Efficient Winning Strategies in Random‐Turn Maker–Breaker Games (2014) (5)
Long cycles in critical graphs (2000) (5)
The randomk-matching-free process: KRIVELEVICHet al.. (2018) (5)
On the trace of random walks on random graphs (2015) (5)
Site percolation on pseudo‐random graphs (2021) (4)
A lower bound for irredundant Ramsey numbers (1998) (4)
Avoider-Enforcer games played on edge disjoint hypergraphs (2012) (4)
Comparing the strength of query types in property testing: The case of k-colorability (2013) (4)
Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs (2019) (4)
On fractional K‐factors of random graphs (2007) (3)
Almost perfect matchings in random uniform hypergraphs (1997) (3)
On fractional K-factors of random graphs (2007) (3)
Generalized hashing and applications to digital fingerprinting (2002) (3)
On subgraphs with degrees of prescribed residues in the random graph (2021) (3)
Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs (2014) (3)
On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs (2021) (3)
Sharp Thresholds for Ramsey Properties of Random Graphs (1999) (3)
Waiter-Client Maximum Degree Game (2018) (3)
On a theorem of lovsz on covers in r -partite hypergraphs (1996) (3)
Random regular graphs of non-constant degree: distribution of edges and applications (2005) (3)
Counting and packing Hamilton $\ell$-cycles in dense hypergraphs (2014) (3)
Fast winning strategies in positional games (2007) (2)
On vertex Ramsey graphs with forbidden subgraphs (2022) (2)
Expansion, long cycles, and complete minors in supercritical random subgraphs of the hypercube (2021) (2)
Fractional Planks (2002) (2)
Problems from Dagstuhl Seminar 07281 : Structure Theory and FPT Algorithmics for Graphs , Digraphs and Hypergraphs (2007) (2)
The Kőnig graph process (2020) (2)
Short proofs for long induced paths (2021) (2)
Hitting time results for Maker-Breaker games: extended abstract (2011) (2)
Lectures on random geometric graphs (2016) (2)
Percolation on High-dimensional Product Graphs (2022) (2)
Asymptotics in bond percolation on expanders (2018) (2)
Turán‐type problems for long cycles in random and pseudo‐random graphs (2019) (2)
Percolation on Irregular High-dimensional Product Graphs (2022) (2)
The Biased Odd Cycle Game (2012) (2)
Expansion in Supercritical Random Subgraphs of Expanders and its Consequences (2022) (2)
Fast construction on a restricted budget (2022) (2)
Complete minors and average degree: A short proof (2022) (2)
Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (2020) (2)
Hamiltonicity of the random geometric graph (2009) (1)
Hierarchy Theorems for Property Testing (2011) (1)
Small Subgraphs in the Trace of a Random Walk (2016) (1)
The Hamiltonicity Game (2014) (1)
Testing Low-Degree Polynomials over (2004) (1)
Hamilton completion and the path cover number of sparse random graphs (2022) (1)
On the distribution of edges in random regular graphs (2005) (1)
Supercritical site percolation on the hypercube: small components are small (2022) (1)
The largest hole in sparse random graphs (2021) (1)
The genus of the Erdős‐Rényi random graph and the fragile genus property (2019) (1)
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments (2016) (1)
The Neighborhood Conjecture (2014) (1)
Cycle lengths in randomly perturbed graphs (2022) (1)
On the Local Resilience of Random Regular Graphs (2009) (1)
The K\H{o}nig Graph Process (2019) (1)
Offline thresholds for Ramsey-type games on random graphs (2010) (1)
Component Games on Random Graphs (2020) (0)
Long Cycles in Locally Expanding Graphs, with Applications (2018) (0)
Minors, connectivity, and diameter in randomly perturbed sparse graphs (2022) (0)
Optimal shattering of complex networks (2019) (0)
Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Product Graphs (2023) (0)
Combinatorics, Probability and Computing (2020) (0)
The Connectivity Game (2014) (0)
The positive minimum degree game on sparse graphs (2012) (0)
IV.19 Extremal and Probabilistic Combinatorics (2010) (0)
A rigorous study of some satisflability problems (2008) (0)
D S ] 8 F eb 2 00 7 Parameterized Algorithms for Directed Maximum Leaf Problems ( Extended Abstract ) (2007) (0)
Compatible Hamilton cycles in Dirac graphs (2016) (0)
C O ] 3 1 M ar 2 00 5 Pseudo-random graphs (2008) (0)
The genus of the Erd\H{o}s-R\'enyi random graph and the fragile genus property (2018) (0)
On the random satisfiable 3 CNF process (2007) (0)
Corrigendum: On fractional K-factors of random graphs (2008) (0)
Spanning Trees at the Connectivity Threshold (2020) (0)
Robin Thomas (1962-2020) (2022) (0)
Combinatorics and Probability (2009) (0)
Submitted to the Annals of Applied Probability HAMILTON CYCLES IN RANDOM GEOMETRIC GRAPHS By (2010) (0)
Probabilistic and Extremal Combinatorics Organizers (2009) (0)
Manipulative waiters with probabilistic intuition Ma lgorzata Bednarska-Bzd ega (2015) (0)
Comparing the strength of query types in property testing: The case of k-colorability (2012) (0)
Oriented discrepancy of Hamilton cycles (2022) (0)
Corrigendum: On fractional K‐factors of random graphs (2008) (0)
Ron Graham (1935-2020) (2020) (0)
The critical bias for the Hamiltonicity game is n / ln n (2009) (0)
Methods and Challenges in Extremal and Probabilistic Combinatorics ∗ Organizers (2015) (0)
Fast and Strong (2014) (0)
The choosability version of Brooks' theorem -- a short proof (2022) (0)
Optimal shattering of complex networks (2019) (0)
Expansion in randomly perturbed connected graphs and its consequences (2013) (0)
Mathematisches Forschungsinstitut Oberwolfach Report No . 20 / 2007 Mini-Workshop : Positional Games Organised (2007) (0)
Cycle Lengths in Expanding Graphs (2020) (0)
Largest subgraph from a hereditary property in a random graph (2022) (0)
Continuous Box game (2011) (0)
Mini-Workshop: Positional Games (2019) (0)
BOUNDED-DEGREE SPANNING TREES IN RANDOMLY (2017) (0)
On unbiased games on random graphs (2007) (0)
Preface (2006) (0)
Proper colouring Painter-Builder game (2016) (0)
C O ] 2 9 O ct 2 01 2 Biased Games On Random Boards Asaf Ferber (2014) (0)

This paper list is powered by the following services:

Other Resources About Michael Krivelevich

en.wikipedia.org

What Schools Are Affiliated With Michael Krivelevich?

Michael Krivelevich is affiliated with the following schools:

Image Attributions

Image Source for Michael Krivelevich