Ks-Free Graphs Without Large Kr-Free Subgraphs. - Michael Krivelevich (Comb. Probab. Comput., 1994)

On a conjecture of Tuza about packing and covering of triangles. - Michael Krivelevich (Discret. Math., 1995)

On the Edge Distribution in Triangle-free Graphs. - Michael Krivelevich (J. Comb. Theory B, 1995)

Bounding Ramsey Numbers through Large Deviation Inequalities. - Michael Krivelevich (Random Struct. Algorithms, 1995)

On a Theorem of Lovász on Covers in tau-Partite Hypergraphs. - Ron Aharoni; Ron Holzman; Michael Krivelevich (Comb., 1996)

On k-saturated graphs with restrictions on the degrees. - Noga Alon; Paul Erdös; Ron Holzman; Michael Krivelevich (J. Graph Theory, 1996)

Perfect fractional matchings in random hypergraphs. - Michael Krivelevich (Random Struct. Algorithms, 1996)

The Concentration of the Chromatic Number of Random Graphs. - Noga Alon; Michael Krivelevich (Comb., 1997)

On the Minimal Number of Edges in Color-Critical Graphs. - Michael Krivelevich (Comb., 1997)

Triangle Factors in Random Graphs. - Michael Krivelevich (Comb. Probab. Comput., 1997)

Almost perfect matchings in random uniform hypergraphs. - Michael Krivelevich (Discret. Math., 1997)

Constructive Bounds for a Ramsey-Type Problem. - Noga Alon; Michael Krivelevich (Graphs Comb., 1997)

Approximate Set Covering in Uniform Hypergraphs. - Michael Krivelevich (J. Algorithms, 1997)

Approximate Coloring of Uniform Hypergraphs (Extended Abstract). - Michael Krivelevich; Benny Sudakov (ESA, 1998)

Finding a Large Hidden Clique in a Random Graph. - Noga Alon; Michael Krivelevich; Benny Sudakov (SODA, 1998)

An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs. - Michael Krivelevich (Electron. J. Comb., 1998)

A lower bound for irredundant Ramsey numbers. - Michael Krivelevich (Discret. Math., 1998)

Coloring Random Graphs. - Michael Krivelevich; Benny Sudakov (Inf. Process. Lett., 1998)

The chromatic numbers of random hypergraphs. - Michael Krivelevich; Benny Sudakov (Random Struct. Algorithms, 1998)

Efficient Testing of Large Graphs. - Noga Alon; Eldar Fischer; Michael Krivelevich; Mario Szegedy (FOCS, 1999)

Regular Languages Are Testable with a Constant Number of Queries. - Noga Alon; Michael Krivelevich; Ilan Newman; Mario Szegedy (FOCS, 1999)

List Coloring of Random and Pseudo-Random Graphs. - Noga Alon; Michael Krivelevich; Benny Sudakov (Comb., 1999)

Coloring Graphs with Sparse Neighborhoods. - Noga Alon; Michael Krivelevich; Benny Sudakov (J. Comb. Theory B, 1999)

Two-coloring Random Hypergraphs. - Dimitris Achlioptas; Jeong Han Kim; Michael Krivelevich; Prasad Tetali (ICALP Satellite Workshops, 2000)

Scalable Secure Storage when Half the System Is Faulty. - Noga Alon; Haim Kaplan; Michael Krivelevich; Dahlia Malkhi; Julien P. Stern (ICALP, 2000)

Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time. - Michael Krivelevich; Van H. Vu (ICALP, 2000)

The Choice Number Of Dense Random Graphs. - Michael Krivelevich (Comb. Probab. Comput., 2000)

Long cycles in critical graphs. - Noga Alon; Michael Krivelevich; Paul D. Seymour (J. Graph Theory, 2000)

Sharp thresholds for certain Ramsey properties of random graphs. - Ehud Friedgut; Michael Krivelevich (Random Struct. Algorithms, 2000)

Approximating coloring and maximum independent sets in 3-uniform hypergraphs. - Michael Krivelevich; Ram Nathaniel; Benny Sudakov (SODA, 2001)

Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. - Andreas Goerdt; Michael Krivelevich (STACS, 2001)

Choosability in Random Hypergraphs. - Michael Krivelevich; Van H. Vu (J. Comb. Theory B, 2001)

Random regular graphs of high degree. - Michael Krivelevich; Benny Sudakov; Van H. Vu; Nicholas C. Wormald (Random Struct. Algorithms, 2001)

Sparse Graphs Usually Have Exponentially Many Optimal Colorings. - Michael Krivelevich (Electron. J. Comb., 2002)

A Sharp Threshold For Network Reliability. - Michael Krivelevich; Benny Sudakov; Van H. Vu (Comb. Probab. Comput., 2002)

Fractional Planks. - Ron Aharoni; Ron Holzman; Michael Krivelevich; Roy Meshulam (Discret. Comput. Geom., 2002)

Hamilton cycles in random subgraphs of pseudo-random graphs. - Alan M. Frieze; Michael Krivelevich (Discret. Math., 2002)

Deciding k-colorability in expected polynomial time. - Michael Krivelevich (Inf. Process. Lett., 2002)

Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time. - Michael Krivelevich; Van H. Vu (J. Comb. Optim., 2002)

Testing k-colorability. - Noga Alon; Michael Krivelevich (SIAM J. Discret. Math., 2002)

Upper bounds on the rate of LDPC Codes. - David Burshtein; Michael Krivelevich; Simon Litsyn; Gadi Miller (IEEE Trans. Inf. Theory, 2002)

Testing Low-Degree Polynomials over GF(2(. - Noga Alon; Tali Kaufman; Michael Krivelevich; Simon Litsyn; Dana Ron (RANDOM-APPROX, 2003)

Tight Bounds for Testing Bipartiteness in General Graphs. - Tali Kaufman; Michael Krivelevich; Dana Ron (RANDOM-APPROX, 2003)

Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. - Noga Alon; Michael Krivelevich; Benny Sudakov (Comb. Probab. Comput., 2003)

The Largest Eigenvalue Of Sparse Random Graphs. - Michael Krivelevich; Benny Sudakov (Comb. Probab. Comput., 2003)

Approximate coloring of uniform hypergraphs. - Michael Krivelevich; Benny Sudakov (J. Algorithms, 2003)

Maximum cuts and judicious partitions in graphs without short cycles. - Noga Alon; Béla Bollobás; Michael Krivelevich; Benny Sudakov (J. Comb. Theory B, 2003)

Generalized hashing and parent-identifying codes. - Noga Alon; Gérard D. Cohen; Michael Krivelevich; Simon Litsyn (J. Comb. Theory A, 2003)

Induced subgraphs of prescribed size. - Noga Alon; Michael Krivelevich; Benny Sudakov (J. Graph Theory, 2003)

Sparse pseudo-random graphs are Hamiltonian. - Michael Krivelevich; Benny Sudakov (J. Graph Theory, 2003)

On the probability of independent sets in random graphs. - Michael Krivelevich; Benny Sudakov; Van H. Vu; Nicholas C. Wormald (Random Struct. Algorithms, 2003)

Covering codes with improved density. - Michael Krivelevich; Benny Sudakov; Van H. Vu (IEEE Trans. Inf. Theory, 2003)

Bounds on distance distributions in codes of known size. - Alexei Ashikhmin; Gérard D. Cohen; Michael Krivelevich; Simon Litsyn (ISIT, 2004)

Triangle Factors In Sparse Pseudo-Random Graphs. - Michael Krivelevich; Benny Sudakov; Tibor Szabó (Comb., 2004)

Colouring powers of cycles from random lists. - Michael Krivelevich; Asaf Nachmias (Eur. J. Comb., 2004)

Algorithms with large domination ratio. - Noga Alon; Gregory Z. Gutin; Michael Krivelevich (J. Algorithms, 2004)

Adding random edges to dense graphs. - Tom Bohman; Alan M. Frieze; Michael Krivelevich; Ryan R. Martin (Random Struct. Algorithms, 2004)

The emergence of a giant component in random subgraphs of pseudo-random graphs. - Alan M. Frieze; Michael Krivelevich; Ryan R. Martin (Random Struct. Algorithms, 2004)

On the random 2-stage minimum spanning tree. - Abraham D. Flaxman; Alan M. Frieze; Michael Krivelevich (SODA, 2005)

Approximation algorithms for cycle packing problems. - Michael Krivelevich; Zeev Nutov; Raphael Yuster (SODA, 2005)

Discrepancy Games. - Noga Alon; Michael Krivelevich; Joel Spencer; Tibor Szabó (Electron. J. Comb., 2005)

On packing Hamilton cycles in ?-regular graphs. - Alan M. Frieze; Michael Krivelevich (J. Comb. Theory B, 2005)

Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. - Joel Friedman; Andreas Goerdt; Michael Krivelevich (SIAM J. Comput., 2005)

The Strong Chromatic Index of Random Graphs. - Alan M. Frieze; Michael Krivelevich; Benny Sudakov (SIAM J. Discret. Math., 2005)

Testing Reed-Muller codes. - Noga Alon; Tali Kaufman; Michael Krivelevich; Simon Litsyn; Dana Ron (IEEE Trans. Inf. Theory, 2005)

Semirandom Models as Benchmarks for Coloring Algorithms. - Michael Krivelevich; Dan Vilenchik (ANALCO, 2006)

Testing triangle-freeness in general graphs. - Noga Alon; Tali Kaufman; Michael Krivelevich; Dana Ron (SODA, 2006)

Solving random satisfiable 3CNF formulas in expected polynomial time. - Michael Krivelevich; Dan Vilenchik (SODA, 2006)

Preface. - Michael Krivelevich; Benny Sudakov (Eur. J. Comb., 2006)

On the asymptotic value of the choice number of complete multi-partite graphs. - Nurit Gazit; Michael Krivelevich (J. Graph Theory, 2006)

Almost universal graphs. - Alan M. Frieze; Michael Krivelevich (Random Struct. Algorithms, 2006)

Coloring complete bipartite graphs from random lists. - Michael Krivelevich; Asaf Nachmias (Random Struct. Algorithms, 2006)

On smoothed analysis in dense graphs and formulas. - Michael Krivelevich; Benny Sudakov; Prasad Tetali (Random Struct. Algorithms, 2006)

Better Algorithms and Bounds for Directed Maximum Leaf Problems. - Noga Alon; Fedor V. Fomin; Gregory Z. Gutin; Michael Krivelevich; Saket Saurabh 001 (FSTTCS, 2007)

Parameterized Algorithms for Directed Maximum Leaf Problems. - Noga Alon; Fedor V. Fomin; Gregory Z. Gutin; Michael Krivelevich; Saket Saurabh 001 (ICALP, 2007)

Why Almost All k -Colorable Graphs Are Easy. - Amin Coja-Oghlan; Michael Krivelevich; Dan Vilenchik (STACS, 2007)

Embedding nearly-spanning bounded degree trees. - Noga Alon; Michael Krivelevich; Benny Sudakov (Comb., 2007)

On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. - Alan M. Frieze; Michael Krivelevich; Cliff Smyth 001 (Comb. Probab. Comput., 2007)

Bart-Moe games, JumbleG and discrepancy. - Dan Hefetz; Michael Krivelevich; Tibor Szabó (Eur. J. Comb., 2007)

Fast winning strategies in positional games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Electron. Notes Discret. Math., 2007)

Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. - Noga Alon; Haim Kaplan; Michael Krivelevich; Dahlia Malkhi; Julien P. Stern (Inf. Comput., 2007)

Avoider-Enforcer games. - Dan Hefetz; Michael Krivelevich; Tibor Szabó (J. Comb. Theory A, 2007)

On fractional K-factors of random graphs. - Simi Haber; Michael Krivelevich (Random Struct. Algorithms, 2007)

Approximation algorithms and hardness results for cycle packing problems. - Michael Krivelevich; Zeev Nutov; Mohammad R. Salavatipour; Jacques Verstraëte; Raphael Yuster (ACM Trans. Algorithms, 2007)

Small Sample Spaces Cannot Fool Low Degree Polynomials. - Noga Alon; Ido Ben-Eliezer; Michael Krivelevich (APPROX-RANDOM, 2008)

Comparing the strength of query types in property testing: the case of testing k-colorability. - Ido Ben-Eliezer; Tali Kaufman; Michael Krivelevich; Dana Ron (SODA, 2008)

On Rainbow Trees and Cycles. - Alan M. Frieze; Michael Krivelevich (Electron. J. Comb., 2008)

Biased Positional Games and Small Hypergraphs with Large Covers. - Michael Krivelevich; Tibor Szabó (Electron. J. Comb., 2008)

Winning Fast in Sparse Graph Construction Games. - Ohad N. Feldheim; Michael Krivelevich (Comb. Probab. Comput., 2008)

The isoperimetric constant of the random graph process. - Itai Benjamini; Simi Haber; Michael Krivelevich; Eyal Lubetzky (Random Struct. Algorithms, 2008)

Corrigendum: On fractional K-factors of random graphs. - Simi Haber; Michael Krivelevich (Random Struct. Algorithms, 2008)

Large Nearly Regular Induced Subgraphs. - Noga Alon; Michael Krivelevich; Benny Sudakov (SIAM J. Discret. Math., 2008)

Planarity, Colorability, and Minor Games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (SIAM J. Discret. Math., 2008)

Hierarchy Theorems for Property Testing. - Oded Goldreich 001; Michael Krivelevich; Ilan Newman; Eyal Rozenberg (APPROX-RANDOM, 2009)

On smoothed k-CNF formulas and the Walksat algorithm. - Amin Coja-Oghlan; Uriel Feige; Alan M. Frieze; Michael Krivelevich; Dan Vilenchik (SODA, 2009)

Hamilton cycles in highly connected and expanding graphs. - Dan Hefetz; Michael Krivelevich; Tibor Szabó (Comb., 2009)

Perfectly Balanced Partitions of Smoothed Graphs. - Ido Ben-Eliezer; Michael Krivelevich (Electron. J. Comb., 2009)

On the Random Satisfiable Process. - Michael Krivelevich; Benny Sudakov; Dan Vilenchik (Comb. Probab. Comput., 2009)

Random regular graphs of non-constant degree: Concentration of the chromatic number. - Sonny Ben-Shimon; Michael Krivelevich (Discret. Math., 2009)

Vertex percolation on expander graphs. - Sonny Ben-Shimon; Michael Krivelevich (Eur. J. Comb., 2009)

Playing to retain the advantage. - Dan Hefetz; Noga Alon; Michael Krivelevich (Electron. Notes Discret. Math., 2009)

Avoider-Enforcer: The Rules of the Game. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Electron. Notes Discret. Math., 2009)

Fast Winning Strategies in Avoider-Enforcer Games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Graphs Comb., 2009)

Fast winning strategies in Maker-Breaker games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (J. Comb. Theory B, 2009)

A sharp threshold for the Hamilton cycle Maker-Breaker game. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Random Struct. Algorithms, 2009)

Avoiding small subgraphs in Achlioptas processes. - Michael Krivelevich; Po-Shen Loh; Benny Sudakov (Random Struct. Algorithms, 2009)

Equitable coloring of random graphs. - Michael Krivelevich; Balázs Patkós (Random Struct. Algorithms, 2009)

Spanning Directed Trees with Many Leaves. - Noga Alon; Fedor V. Fomin; Gregory Z. Gutin; Michael Krivelevich; Saket Saurabh 001 (SIAM J. Discret. Math., 2009)

Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability. - Ido Ben-Eliezer; Tali Kaufman; Michael Krivelevich; Dana Ron (Property Testing, 2010)

Hierarchy Theorems for Property Testing. - Oded Goldreich 001; Michael Krivelevich; Ilan Newman; Eyal Rozenberg (Property Testing, 2010)

A note on regular Ramsey graphs. - Noga Alon; Sonny Ben-Shimon; Michael Krivelevich (J. Graph Theory, 2010)

The rainbow connection of a graph is (at most) reciprocal to its minimum degree. - Michael Krivelevich; Raphael Yuster (J. Graph Theory, 2010)

Why Almost All k-Colorable Graphs Are Easy to Color. - Amin Coja-Oghlan; Michael Krivelevich; Dan Vilenchik (Theory Comput. Syst., 2010)

Hamiltonicity thresholds in Achlioptas processes. - Michael Krivelevich; Eyal Lubetzky; Benny Sudakov (Random Struct. Algorithms, 2010)

Offline thresholds for Ramsey-type games on random graphs. - Michael Krivelevich; Reto Spöhel; Angelika Steger (Random Struct. Algorithms, 2010)

Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. - Colin Cooper; Alan M. Frieze; Michael Krivelevich (SIAM J. Discret. Math., 2010)

Embedding Spanning Trees in Random Graphs. - Michael Krivelevich (SIAM J. Discret. Math., 2010)

Resilient Pancyclicity of Random and Pseudorandom Graphs. - Michael Krivelevich; Choongbum Lee; Benny Sudakov (SIAM J. Discret. Math., 2010)

Hitting time results for Maker-Breaker games. - Sonny Ben-Shimon; Asaf Ferber; Dan Hefetz; Michael Krivelevich (SODA, 2011)

Packing tight Hamilton cycles in 3-uniform hypergraphs. - Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (SODA, 2011)

The Number of f-Matchings in Almost Every Tree is a Zero Residue. - Noga Alon; Simi Haber; Michael Krivelevich (Electron. J. Comb., 2011)

Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs. - Sonny Ben-Shimon; Michael Krivelevich; Benny Sudakov (Comb. Probab. Comput., 2011)

Global Maker-Breaker games on sparse graphs. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Eur. J. Comb., 2011)

Fast embedding of spanning trees in biased Maker-Breaker games. - Dan Hefetz; Asaf Ferber; Michael Krivelevich (Electron. Notes Discret. Math., 2011)

Ramsey games with giants. - Tom Bohman; Alan M. Frieze; Michael Krivelevich; Po-Shen Loh; Benny Sudakov (Random Struct. Algorithms, 2011)

Regular induced subgraphs of a random Graph. - Michael Krivelevich; Benny Sudakov; Nicholas C. Wormald (Random Struct. Algorithms, 2011)

On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs. - Sonny Ben-Shimon; Michael Krivelevich; Benny Sudakov (SIAM J. Discret. Math., 2011)

Expanders are universal for the class of all spanning trees. - Daniel Johannsen; Michael Krivelevich; Wojciech Samotij (SODA, 2012)

On the Number of Hamilton Cycles in Pseudo-Random Graphs. - Michael Krivelevich (Electron. J. Comb., 2012)

Fast Strategies In Maker-Breaker Games Played on Random Boards. - Dennis Clemens; Asaf Ferber; Michael Krivelevich; Anita Liebenau (Comb. Probab. Comput., 2012)

Biased orientation games. - Ido Ben-Eliezer; Michael Krivelevich; Benny Sudakov (Discret. Math., 2012)

The size Ramsey number of a directed path. - Ido Ben-Eliezer; Michael Krivelevich; Benny Sudakov (J. Comb. Theory B, 2012)

Long cycles in subgraphs of (pseudo)random directed graphs. - Ido Ben-Eliezer; Michael Krivelevich; Benny Sudakov (J. Graph Theory, 2012)

Variations on cops and robbers. - Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (J. Graph Theory, 2012)

Packing hamilton cycles in random and pseudo-random hypergraphs. - Alan M. Frieze; Michael Krivelevich (Random Struct. Algorithms, 2012)

Sharp threshold for the appearance of certain spanning trees in random graphs. - Dan Hefetz; Michael Krivelevich; Tibor Szabó (Random Struct. Algorithms, 2012)

Creating Small Subgraphs in Achlioptas Processes With Growing Parameter. - Michael Krivelevich; Reto Spöhel (SIAM J. Discret. Math., 2012)

Optimal Packings of Hamilton Cycles in Sparse Random Graphs. - Michael Krivelevich; Wojciech Samotij (SIAM J. Discret. Math., 2012)

Comparing the strength of query types in property testing: The case of k-colorability. - Ido Ben-Eliezer; Tali Kaufman; Michael Krivelevich; Dana Ron (Comput. Complex., 2013)

The Biased Odd Cycle Game. - Asaf Ferber; Roman Glebov; Michael Krivelevich; Hong Liu 010; Cory Palmer; Tomás Valla; Máté Vizer (Electron. J. Comb., 2013)

On the Non-Planarity of a Random Subgraph. - Alan M. Frieze; Michael Krivelevich (Comb. Probab. Comput., 2013)

Avoider-Enforcer games played on edge disjoint hypergraphs. - Asaf Ferber; Michael Krivelevich; Alon Naor (Discret. Math., 2013)

Longest cycles in sparse random digraphs. - Michael Krivelevich; Eyal Lubetzky; Benny Sudakov (Random Struct. Algorithms, 2013)

The phase transition in random graphs: A simple proof. - Michael Krivelevich; Benny Sudakov (Random Struct. Algorithms, 2013)

On the Number of Hamilton Cycles in Sparse Random Graphs. - Roman Glebov; Michael Krivelevich (SIAM J. Discret. Math., 2013)

Smoothed Analysis on Connected Graphs. - Michael Krivelevich; Daniel Reichman 001; Wojciech Samotij (APPROX-RANDOM, 2014)

Packing Tree Factors in Random and Pseudo-random Graphs. - Deepak Bal; Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (Electron. J. Comb., 2014)

Long Paths and Cycles in Random Subgraphs of $ mathcal{H}$-free Graphs. - Michael Krivelevich; Wojciech Samotij (Electron. J. Comb., 2014)

On covering expander graphs by hamilton cycles. - Roman Glebov; Michael Krivelevich; Tibor Szabó (Random Struct. Algorithms, 2014)

Contagious Sets in Expanders. - Amin Coja-Oghlan; Uriel Feige; Michael Krivelevich; Daniel Reichman 001 (SODA, 2015)

Random-Player Maker-Breaker games. - Michael Krivelevich; Gal Kronenberg (Electron. J. Comb., 2015)

Decomposing Random Graphs into Few Cycles and Edges. - Dániel Korándi; Michael Krivelevich; Benny Sudakov (Comb. Probab. Comput., 2015)

Some Remarks on Rainbow Connectivity. - Nina Kamcev; Michael Krivelevich; Benny Sudakov (Electron. Notes Discret. Math., 2015)

Cycles and matchings in randomly perturbed digraphs and hypergraphs. - Michael Krivelevich; Matthew Kwan 001; Benny Sudakov (Electron. Notes Discret. Math., 2015)

Biased games on random boards. - Asaf Ferber; Roman Glebov; Michael Krivelevich; Alon Naor (Random Struct. Algorithms, 2015)

Generating random graphs in biased Maker-Breaker games. - Asaf Ferber; Michael Krivelevich; Humberto Naves (Random Struct. Algorithms, 2015)

Long paths and cycles in random subgraphs of graphs with large minimum degree. - Michael Krivelevich; Choongbum Lee; Benny Sudakov (Random Struct. Algorithms, 2015)

Walker-Breaker Games. - Lisa Espig; Alan M. Frieze; Michael Krivelevich; Wesley Pegden (SIAM J. Discret. Math., 2015)

Large Subgraphs without Short Cycles. - Florent Foucaud; Michael Krivelevich; Guillem Perarnau (SIAM J. Discret. Math., 2015)

Random Graphs, Geometry and Asymptotic Structure. - Michael Krivelevich; Konstantinos Panagiotou; Mathew D. Penrose; Colin J. H. McDiarmid (Cambridge University Press, 2016)

Client-Waiter Games on Complete and Random Graphs. - Oren Dean; Michael Krivelevich (Electron. J. Comb., 2016)

The Phase Transition in Site Percolation on Pseudo-Random Graphs. - Michael Krivelevich (Electron. J. Comb., 2016)

Manipulative Waiters with Probabilistic Intuition. - Malgorzata Bednarska-Bzdega; Dan Hefetz; Michael Krivelevich; Tomasz Luczak 001 (Comb. Probab. Comput., 2016)

Waiter-Client and Client-Waiter planarity, colorability and minor games. - Dan Hefetz; Michael Krivelevich; Wei En Tan (Discret. Math., 2016)

On saturation games. - Dan Hefetz; Michael Krivelevich; Alon Naor; Milos Stojakovic (Eur. J. Comb., 2016)

Editorial. - Michael Krivelevich; Bojan Mohar (J. Comb. Theory B, 2016)

Finding Hamilton cycles in random graphs with few queries. - Asaf Ferber; Michael Krivelevich; Benny Sudakov; Pedro Vieira 003 (Random Struct. Algorithms, 2016)

Compatible Hamilton cycles in random graphs. - Michael Krivelevich; Choongbum Lee; Benny Sudakov (Random Struct. Algorithms, 2016)

Compatible Hamilton cycles in Dirac graphs. - Michael Krivelevich; Choongbum Lee; Benny Sudakov (Comb., 2017)

Small Subgraphs in the Trace of a Random Walk. - Michael Krivelevich; Peleg Michaeli (Electron. J. Comb., 2017)

Waiter-Client and Client-Waiter Hamiltonicity games on random graphs. - Dan Hefetz; Michael Krivelevich; Wei En Tan (Eur. J. Comb., 2017)

Counting and packing Hamilton cycles in dense graphs and oriented graphs. - Asaf Ferber; Michael Krivelevich; Benny Sudakov (J. Comb. Theory B, 2017)

Efficient Winning Strategies in Random-Turn Maker-Breaker Games. - Asaf Ferber; Michael Krivelevich; Gal Kronenberg (J. Graph Theory, 2017)

Finding paths in sparse random graphs requires many queries. - Asaf Ferber; Michael Krivelevich; Benny Sudakov; Pedro Vieira 003 (Random Struct. Algorithms, 2017)

Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. - Michael Krivelevich; Matthew Kwan 001; Benny Sudakov (SIAM J. Discret. Math., 2017)

The Genus of the Erdös-Rényi Random Graph and the Fragile Genus Property. - Chris Dowden; Mihyun Kang; Michael Krivelevich (AofA, 2018)

Packing Hamilton Cycles Online. - Joseph Briggs; Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (Comb. Probab. Comput., 2018)

Proper colouring Painter-Builder game. - Malgorzata Bednarska-Bzdega; Michael Krivelevich; Viola Mészáros; Clément Requilé (Discret. Math., 2018)

Clique coloring of dense random graphs. - Noga Alon; Michael Krivelevich (J. Graph Theory, 2018)

On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. - Lior Gishboliner; Michael Krivelevich; Gal Kronenberg (Random Struct. Algorithms, 2018)

The random k-matching-free process. - Michael Krivelevich; Matthew Kwan 001; Po-Shen Loh; Benny Sudakov (Random Struct. Algorithms, 2018)

Elegantly Colored Paths and Cycles in Edge Colored Random Graphs. - Lisa Espig; Alan M. Frieze; Michael Krivelevich (SIAM J. Discret. Math., 2018)

Finding and Using Expanders in Locally Sparse Graphs. - Michael Krivelevich (SIAM J. Discret. Math., 2018)

Expanders - how to find them, and what to find in them. - Michael Krivelevich (BCC, 2019)

Optimal shattering of complex networks. - Nicole Balashov; Reuven Cohen; Avieli Haber; Michael Krivelevich; Simi Haber (Appl. Netw. Sci., 2019)

Long Cycles in Locally Expanding Graphs, with Applications. - Michael Krivelevich (Comb., 2019)

Goldberg's conjecture is true for random multigraphs. - Penny Haxell; Michael Krivelevich; Gal Kronenberg (J. Comb. Theory B, 2019)

Greedy Maximal Independent Sets via Local Limits. - Michael Krivelevich; Tamás Mészáros 001; Peleg Michaeli; Clara Shikhelman (AofA, 2020)

Very fast construction of bounded-degree spanning graphs via the semi-random graph process. - Omri Ben-Eliezer; Lior Gishboliner; Dan Hefetz; Michael Krivelevich (SODA, 2020)

Random Graph's Hamiltonicity is Strongly Tied to its Minimum Degree. - Yahav Alon; Michael Krivelevich (Electron. J. Comb., 2020)

Edge-statistics on large graphs. - Noga Alon; Dan Hefetz; Michael Krivelevich; Mykhaylo Tyomkyn (Comb. Probab. Comput., 2020)

Ron Graham (1935-2020). - Michael Krivelevich; Bojan Mohar (J. Comb. Theory B, 2020)

Finding a Hamilton cycle fast on average using rotations and extensions. - Yahav Alon; Michael Krivelevich (Random Struct. Algorithms, 2020)

The Kőnig graph process. - Nina Kamcev; Michael Krivelevich; Natasha Morrison; Benny Sudakov (Random Struct. Algorithms, 2020)

Asymptotics in percolation on high-girth expanders. - Michael Krivelevich; Eyal Lubetzky; Benny Sudakov (Random Struct. Algorithms, 2020)

Rolling backwards can move you forward: on embedding problems in sparse expanders. - Nemanja Draganic; Michael Krivelevich; Rajko Nenadov (SODA, 2021)

Cycle Lengths in Expanding Graphs. - Limor Friedman; Michael Krivelevich (Comb., 2021)

Large complete minors in random subgraphs. - Joshua Erde; Mihyun Kang; Michael Krivelevich (Comb. Probab. Comput., 2021)

Divisible subdivisions. - Noga Alon; Michael Krivelevich (J. Graph Theory, 2021)

The size-Ramsey number of short subdivisions. - Nemanja Draganic; Michael Krivelevich; Rajko Nenadov (Random Struct. Algorithms, 2021)

On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs. - Sahar Diskin; Michael Krivelevich (Electron. J. Comb., 2022)

Short proofs for long induced paths. - Nemanja Draganic; Stefan Glock; Michael Krivelevich (Comb. Probab. Comput., 2022)

Discrepancies of spanning trees and Hamilton cycles. - Lior Gishboliner; Michael Krivelevich; Peleg Michaeli (J. Comb. Theory B, 2022)

Cycle lengths in sparse random graphs. - Yahav Alon; Michael Krivelevich; Eyal Lubetzky (Random Struct. Algorithms, 2022)

The largest hole in sparse random graphs. - Nemanja Draganic; Stefan Glock; Michael Krivelevich (Random Struct. Algorithms, 2022)

Color-biased Hamilton cycles in random graphs. - Lior Gishboliner; Michael Krivelevich; Peleg Michaeli (Random Struct. Algorithms, 2022)

Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs. - Yahav Alon; Michael Krivelevich (SIAM J. Discret. Math., 2022)

Spanning Trees at the Connectivity Threshold. - Yahav Alon; Michael Krivelevich; Peleg Michaeli (SIAM J. Discret. Math., 2022)

Component Games on Random Graphs. - Rani Hod; Michael Krivelevich; Tobias Müller 001; Alon Naor; Nicholas C. Wormald (Comb., 2022)

Robin Thomas (1962-2020). - Michael Krivelevich; Bojan Mohar (J. Comb. Theory B, 2023)

Supercritical site percolation on the hypercube: small components are small. - Sahar Diskin; Michael Krivelevich (Comb. Probab. Comput., 2023)

Complete minors and average degree: A short proof. - Noga Alon; Michael Krivelevich; Benny Sudakov (J. Graph Theory, 2023)

Oriented discrepancy of Hamilton cycles. - Lior Gishboliner; Michael Krivelevich; Peleg Michaeli (J. Graph Theory, 2023)

On subgraphs with degrees of prescribed residues in the random graph. - Asaf Ferber; Liam Hardiman; Michael Krivelevich (Random Struct. Algorithms, 2023)

Largest subgraph from a hereditary property in a random graph. - Noga Alon; Michael Krivelevich; Wojciech Samotij (Discret. Math., 2023)

Site percolation on pseudo-random graphs. - Sahar Diskin; Michael Krivelevich (Random Struct. Algorithms, 2023)

Cycle lengths in randomly perturbed graphs. - Elad Aigner-Horev; Dan Hefetz; Michael Krivelevich (Random Struct. Algorithms, 2023)

Percolation on irregular high-dimensional product graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Comb. Probab. Comput., 2024)

Maximum chordal subgraphs of random graphs. - Michael Krivelevich; Maksim Zhukovskii (Comb. Probab. Comput., 2024)

Hamilton completion and the path cover number of sparse random graphs. - Yahav Alon; Michael Krivelevich (Eur. J. Comb., 2024)

Expansion in supercritical random subgraphs of expanders and its consequences. - Sahar Diskin; Michael Krivelevich (Random Struct. Algorithms, 2024)

On vertex Ramsey graphs with forbidden subgraphs. - Sahar Diskin; Ilay Hoshen; Michael Krivelevich; Maksim Zhukovskii (Discret. Math., 2024)

Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Comb., 2024)

Reconstructing Random Graphs from Distance Queries. - Michael Krivelevich; Maksim Zhukovskii (ESA, 2025)

Disjoint Connected Dominating Sets in Pseudorandom Graphs. - Nemanja Draganic; Michael Krivelevich (STOC, 2025)

Long Cycles in Percolated Expanders. - Maurício Collares; Sahar Diskin; Joshua Erde; Michael Krivelevich (Electron. J. Comb., 2025)

Colouring random subgraphs. - Boris Bukh; Michael Krivelevich; Bhargav Narayanan (Comb. Probab. Comput., 2025)

Minors, connectivity, and diameter in randomly perturbed sparse graphs. - Elad Aigner-Horev; Dan Hefetz; Michael Krivelevich (Eur. J. Comb., 2025)

Rigid partitions: From high connectivity to random graphs. - Michael Krivelevich; Alan Lew; Peleg Michaeli (J. Comb. Theory B, 2025)

Sparse Pancyclic Subgraphs of Random Graphs. - Yahav Alon; Michael Krivelevich (SIAM J. Discret. Math., 2025)

Percolation on High-Dimensional Product Graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Random Struct. Algorithms, 2025)

On the edge expansion of random polytopes. - Asaf Ferber; Michael Krivelevich; Marcelo Sales; Wojciech Samotij (CoRR, 2025)