Publications (98)
Packing Hamilton Cycles in Random and Pseudo-Random Hypergraphs
Alan Frieze, Michael Krivelevich
The emergence of a giant component in random subgraphs of pseudo-random graphs
Alan Frieze, Michael Krivelevich, Ryan R. Martin
Hamiltonicity thresholds in Achlioptas processes
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
Fast embedding of spanning trees in biased Maker-Breaker games
Asaf Ferber, Dan Hefetz, Michael Krivelevich
Biased orientation games
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
A Lower Bound on the Density of Sphere Packings via Graph Theory
Michael Krivelevich, Simon Litsyn, Alexander Vardy
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov
Compatible Hamilton cycles in random graphs
Michael Krivelevich, Choongbum Lee, Benny Sudakov
The critical bias for the Hamiltonicity game is (1+o(1))n/ln n
Michael Krivelevich
Waiter-Client Maximum Degree Game
Michael Krivelevich, Nadav Trumer
Generating random graphs in biased Maker-Breaker games
Asaf Ferber, Michael Krivelevich, Humberto Naves
Resilient pancyclicity of random and pseudo-random graphs
Michael Krivelevich, Choongbum Lee, Benny Sudakov
Finding and using expanders in locally sparse graphs
Michael Krivelevich
Decomposing random graphs into few cycles and edges
Dániel Korándi, Michael Krivelevich, Benny Sudakov
Long paths and cycles in random subgraphs of H-free graphs
Michael Krivelevich, Wojciech Samotij
On the trace of random walks on random graphs
Alan Frieze, Michael Krivelevich, Peleg Michaeli +1
On the number of Hamilton cycles in pseudo-random graphs
Michael Krivelevich
THe largest eigenvalue of sparse random graphs
Michael Krivelevich, Benny Sudakov
Parameterized Algorithms for Directed Maximum Leaf Problems
Noga Alon, Fedor Fomin, Gregory Gutin +2
The phase transition in site percolation on pseudo-random graphs
Michael Krivelevich
Random-Player Maker-Breaker games
Michael Krivelevich, Gal Kronenberg
Hitting time results for Maker-Breaker games
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz +1
Fast winning strategies in Avoider-Enforcer games
Dan Hefetz, Michael Krivelevich, MiloÅ¡ StojakoviÄ +1
Manipulative waiters with probabilistic intuition
MaŠgorzata Bednarska-Bzdȩga, Dan Hefetz, Michael Krivelevich +1
Colouring complete bipartite graphs from random lists
Michael Krivelevich, Asaf Nachmias
Counting and packing Hamilton $\ell$-cycles in dense hypergraphs
Asaf Ferber, Michael Krivelevich, Benny Sudakov
On the non-planarity of a random subgraph
Alan Frieze, Michael Krivelevich
Waiter-Client and Client-Waiter planarity, colorability and minor games
Dan Hefetz, Michael Krivelevich, Wei En Tan
Packing Hamilton Cycles Online
Joseph Briggs, Alan Frieze, Michael Krivelevich +2
The number of F-matchings in almost every tree is a zero residue
Noga Alon, Simi Haber, Michael Krivelevich
Complete minors in graphs without sparse cuts
Michael Krivelevich, Rajko Nenadov
Ramsey games with giants
Tom Bohman, Alan Frieze, Michael Krivelevich +2
Cores of random graphs are born Hamiltonian
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
On covering expander graphs by Hamilton cycles
Roman Glebov, Michael Krivelevich, Tibor Szabó
On the random satisfiable process
Michael Krivelevich, Benny Sudakov, Dan Vilenchik
Rainbow Hamilton cycles in random graphs and hypergraphs
Asaf Ferber, Michael Krivelevich
Large nearly regular induced subgraphs
Noga Alon, Michael Krivelevich, Benny Sudakov
Compatible Hamilton cycles in Dirac graphs
Michael Krivelevich, Choongbum Lee, Benny Sudakov
Robust Hamiltonicity of Dirac graphs
Michael Krivelevich, Choongbum Lee, Benny Sudakov
A note on regular Ramsey graphs
Noga Alon, Sonny Ben-Shimon, Michael Krivelevich
Some Remarks on Rainbow Connectivity
Nina KamÄev, Michael Krivelevich, Benny Sudakov
Efficient winning strategies in random-turn Maker-Breaker games
Asaf Ferber, Michael Krivelevich, Gal Kronenberg
Biased Games On Random Boards
Asaf Ferber, Roman Glebov, Michael Krivelevich +1
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments
Lior Gishboliner, Michael Krivelevich, Gal Kronenberg
Fast strategies in Maker-Breaker games played on random boards
Dennis Clemens, Asaf Ferber, Michael Krivelevich +1
Embedding spanning trees in random graphs
Michael Krivelevich
Goldberg's Conjecture is true for random multigraphs
Penny Haxell, Michael Krivelevich, Gal Kronenberg
Proper colouring Painter-Builder game
MaÅgorzata Bednarska-BzdÄga, Michael Krivelevich, Viola Mészáros +1
The phase transition in random graphs - a simple proof
Michael Krivelevich, Benny Sudakov
Better Algorithms and Bounds for Directed Maximum Leaf Problems
Noga Alon, Fedor V. Fomin, Gregory Gutin +2
Finding paths in sparse random graphs requires many queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov +1
Long paths and cycles in random subgraphs of graphs with large minimum degree
Michael Krivelevich, Choongbum Lee, Benny Sudakov
The size Ramsey number of a directed path
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
Counting and packing Hamilton cycles in dense graphs and oriented graphs
Asaf Ferber, Michael Krivelevich, Benny Sudakov
Positional Games
Michael Krivelevich
Expanders - how to find them, and what to find in them
Michael Krivelevich
Optimal packings of Hamilton cycles in sparse random graphs
Michael Krivelevich, Wojciech Samotij
Embedding nearly-spanning bounded degree trees
Noga Alon, Michael Krivelevich, Benny Sudakov
The random k-matching-free process
Michael Krivelevich, Matthew Kwan, Po-Shen Loh +1
Local resilience and Hamiltonicity Maker-Breaker games in random-regular graphs
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov
Client-Waiter games on complete and random graphs
Oren Dean, Michael Krivelevich
Long paths and Hamiltonicity in random graphs
Michael Krivelevich
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs
Dan Hefetz, Michael Krivelevich, Wei En Tan
Smoothed analysis on connected graphs
Michael Krivelevich, Daniel Reichman, Wojciech Samotij
On the asymptotic value of the choice number of complete multi-partite graphs
Nurit Gazit, Michael Krivelevich
Large subgraphs without short cycles
Florent Foucaud, Michael Krivelevich, Guillem Perarnau
Packing tight Hamilton cycles in 3-uniform hypergraphs
Alan Frieze, Michael Krivelevich, Po-Shen Loh
Elegantly colored paths and cycles in edge colored random graphs
Lisa Espig, Alan Frieze, Michael Krivelevich
Hamilton cycles in random geometric graphs
József Balogh, Béla Bollobás, Michael Krivelevich +2
Hamiltonicity of the random geometric graph
Michael Krivelevich, Tobias Muller
Clique coloring of dense random graphs
Noga Alon, Michael Krivelevich
Contagious Sets in Expanders
Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich +1
Vertex Percolation on Expander Graphs
Sonny Ben-Shimon, Michael Krivelevich
On the concentration of eigenvalues of random symmetric matrices
Michael Krivelevich, Van H. Vu
Long cycles in locally expanding graphs, with applications
Michael Krivelevich
Packing tree factors in random and pseudo-random graphs
Deepak Bal, Alan Frieze, Michael Krivelevich +1
The isoperimetric constant of the random graph process
Itai Benjamini, Simi Haber, Michael Krivelevich +1
On saturation games
Dan Hefetz, Michael Krivelevich, Alon Naor +1
Walker-Breaker games
Lisa Espig, Alan Frieze, Wesley Pegden +1
The biased odd cycle game
Asaf Ferber, Roman Glebov, Michael Krivelevich +4
Pseudo-random graphs
Michael Krivelevich, Benny Sudakov
Finding Hamilton cycles in random graphs with few queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov +1
Minors in expanding graphs
Michael Krivelevich, Benny Sudakov
Cycles and matchings in randomly perturbed digraphs and hypergraphs
Michael Krivelevich, Matthew Kwan, Benny Sudakov
Adding random edges to dense graphs
Tom Bohman, Alan Frieze, Michael Krivelevich +1
Random regular graphs of non-constant degree: Concentration of the chromatic number
Sonny Ben-Shimon, Michael Krivelevich
Long cycles in subgraphs of (pseudo)random directed graphs
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
Colouring powers of cycles from random lists
Michael Krivelevich, Asaf Nachmias
Avoider-Enforcer games played on edge disjoint hypergraphs
Asaf Ferber, Michael Krivelevich, Alon Naor
Contagious Sets in Random Graphs
Uriel Feige, Michael Krivelevich, Daniel Reichman
Avoiding small subgraphs in Achlioptas processes
Michael Krivelevich, Po-Shen Loh, Benny Sudakov
Expanders Are Universal for the Class of All Spanning Trees
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
Regular induced subgraphs of a random graph
Michael Krivelevich, Benny Sudakov, Nicholas Wormald
A construction of almost Steiner systems
Asaf Ferber, Rani Hod, Michael Krivelevich +1
Variations on Cops and Robbers
Alan Frieze, Michael Krivelevich, Po-Shen Loh
Longest cycles in sparse random digraphs
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
The genus of the ErdÅs-Rényi random graph and the fragile genus property
Chris Dowden, Mihyun Kang, Michael Krivelevich
Hamilton cycles in highly connected and expanding graphs
Dan Hefetz, Michael Krivelevich, Tibor Szabo