Michael Krivelevich

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 80

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

SIAM J. Discret. Math.

Electron. J. Comb.

Publications

Sahar Diskin, Ilay Hoshen, Michael Krivelevich, Maksim Zhukovskii
On vertex Ramsey graphs with forbidden subgraphs. Discret. Math. 347 (3) (2024)
Yahav Alon, Michael Krivelevich
Hamilton completion and the path cover number of sparse random graphs. Eur. J. Comb. 118 (2024)
Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich
Percolation on irregular high-dimensional product graphs. Comb. Probab. Comput. 33 (3) (2024)
Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs. Comb. 44 (4) (2024)
Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, Clara Shikhelman
Greedy maximal independent sets via local limits. Random Struct. Algorithms 64 (4) (2024)
Sahar Diskin, Michael Krivelevich
Supercritical site percolation on the hypercube: small components are small. Comb. Probab. Comput. 32 (3) (2023)
Noga Alon, Michael Krivelevich, Benny Sudakov
Complete minors and average degree: A short proof. J. Graph Theory 103 (3) (2023)
Sahar Diskin, Michael Krivelevich
Site percolation on pseudo-random graphs. Random Struct. Algorithms 63 (2) (2023)
Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich
Cycle lengths in randomly perturbed graphs. Random Struct. Algorithms 63 (4) (2023)
Michael Krivelevich, Bojan Mohar
Robin Thomas (1962-2020). J. Comb. Theory, Ser. B 158 (Part) (2023)
Noga Alon, Michael Krivelevich, Wojciech Samotij
Largest subgraph from a hereditary property in a random graph. Discret. Math. 346 (9) (2023)
Asaf Ferber, Liam Hardiman, Michael Krivelevich
On subgraphs with degrees of prescribed residues in the random graph. Random Struct. Algorithms 63 (1) (2023)
Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
Oriented discrepancy of Hamilton cycles. J. Graph Theory 103 (4) (2023)
Sahar Diskin, Michael Krivelevich
On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs. Electron. J. Comb. 29 (3) (2022)
Yahav Alon, Michael Krivelevich, Peleg Michaeli
Spanning Trees at the Connectivity Threshold. SIAM J. Discret. Math. 36 (3) (2022)
Nemanja Draganic, Stefan Glock, Michael Krivelevich
The largest hole in sparse random graphs. Random Struct. Algorithms 61 (4) (2022)
Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
Color-biased Hamilton cycles in random graphs. Random Struct. Algorithms 60 (3) (2022)
Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
Discrepancies of spanning trees and Hamilton cycles. J. Comb. Theory, Ser. B 154 (2022)
Rani Hod, Michael Krivelevich, Tobias Müller, Alon Naor, Nicholas C. Wormald
Component Games on Random Graphs. Comb. 42 (6) (2022)
Nemanja Draganic, Stefan Glock, Michael Krivelevich
Short proofs for long induced paths. Comb. Probab. Comput. 31 (5) (2022)
Yahav Alon, Michael Krivelevich, Eyal Lubetzky
Cycle lengths in sparse random graphs. Random Struct. Algorithms 61 (3) (2022)
Yahav Alon, Michael Krivelevich
Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs. SIAM J. Discret. Math. 36 (1) (2022)
Nemanja Draganic, Michael Krivelevich, Rajko Nenadov
The size-Ramsey number of short subdivisions. Random Struct. Algorithms 59 (1) (2021)
Noga Alon, Michael Krivelevich
Divisible subdivisions. J. Graph Theory 98 (4) (2021)
Joshua Erde, Mihyun Kang, Michael Krivelevich
Large complete minors in random subgraphs. Comb. Probab. Comput. 30 (4) (2021)
Limor Friedman, Michael Krivelevich
Cycle Lengths in Expanding Graphs. Comb. 41 (1) (2021)
Nemanja Draganic, Michael Krivelevich, Rajko Nenadov
Rolling backwards can move you forward: on embedding problems in sparse expanders. SODA (2021)
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. Random Struct. Algorithms 57 (4) (2020)
Michael Krivelevich, Bojan Mohar
Ron Graham (1935-2020). J. Comb. Theory, Ser. B 145 (2020)
Noga Alon, Dan Hefetz, Michael Krivelevich, Mykhaylo Tyomkyn
Edge-statistics on large graphs. Comb. Probab. Comput. 29 (2) (2020)
Yahav Alon, Michael Krivelevich
Finding a Hamilton cycle fast on average using rotations and extensions. Random Struct. Algorithms 57 (1) (2020)
Chris Dowden, Mihyun Kang, Michael Krivelevich
The genus of the Erdős-Rényi random graph and the fragile genus property. Random Struct. Algorithms 56 (1) (2020)
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
Asymptotics in percolation on high-girth expanders. Random Struct. Algorithms 56 (4) (2020)
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. SODA (2020)
Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, Clara Shikhelman
Greedy Maximal Independent Sets via Local Limits. AofA (2020)
Nina Kamcev, Michael Krivelevich, Natasha Morrison, Benny Sudakov
The Kőnig graph process. Random Struct. Algorithms 57 (4) (2020)
Yahav Alon, Michael Krivelevich
Random Graph's Hamiltonicity is Strongly Tied to its Minimum Degree. Electron. J. Comb. 27 (1) (2020)
Nicole Balashov, Reuven Cohen, Avieli Haber, Michael Krivelevich, Simi Haber
Optimal shattering of complex networks. Appl. Netw. Sci. 4 (1) (2019)
Michael Krivelevich
Expanders - how to find them, and what to find in them. BCC (2019)
Nicole Balashov, Reuven Cohen, Avieli Haber, Michael Krivelevich, Simi Haber
Optimal shattering of complex networks. CoRR (2019)
Penny Haxell, Michael Krivelevich, Gal Kronenberg
Goldberg's conjecture is true for random multigraphs. J. Comb. Theory, Ser. B 138 (2019)
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. CoRR (2019)
Michael Krivelevich
Long Cycles in Locally Expanding Graphs, with Applications. Comb. 39 (1) (2019)
Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov
The random k-matching-free process. Random Struct. Algorithms 53 (4) (2018)
Lior Gishboliner, Michael Krivelevich, Gal Kronenberg
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. Random Struct. Algorithms 52 (4) (2018)
Michael Krivelevich
Finding and Using Expanders in Locally Sparse Graphs. SIAM J. Discret. Math. 32 (1) (2018)
Noga Alon, Michael Krivelevich
Clique coloring of dense random graphs. J. Graph Theory 88 (3) (2018)
Chris Dowden, Mihyun Kang, Michael Krivelevich
The Genus of the Erdös-Rényi Random Graph and the Fragile Genus Property. AofA (2018)
Lisa Espig, Alan M. Frieze, Michael Krivelevich
Elegantly Colored Paths and Cycles in Edge Colored Random Graphs. SIAM J. Discret. Math. 32 (3) (2018)
Malgorzata Bednarska-Bzdega, Michael Krivelevich, Viola Mészáros, Clément Requilé
Proper colouring Painter-Builder game. Discret. Math. 341 (3) (2018)
Joseph Briggs, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
Packing Hamilton Cycles Online. Comb. Probab. Comput. 27 (4) (2018)
Michael Krivelevich, Peleg Michaeli
Small Subgraphs in the Trace of a Random Walk. Electron. J. Comb. 24 (1) (2017)
Asaf Ferber, Michael Krivelevich, Benny Sudakov
Counting and packing Hamilton cycles in dense graphs and oriented graphs. J. Comb. Theory, Ser. B 122 (2017)
Michael Krivelevich, Matthew Kwan, Benny Sudakov
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. SIAM J. Discret. Math. 31 (1) (2017)
Michael Krivelevich, Choongbum Lee, Benny Sudakov
Compatible Hamilton cycles in Dirac graphs. Comb. 37 (4) (2017)
Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira
Finding paths in sparse random graphs requires many queries. Random Struct. Algorithms 50 (1) (2017)
Dan Hefetz, Michael Krivelevich, Wei En Tan
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs. Eur. J. Comb. 63 (2017)
Asaf Ferber, Michael Krivelevich, Gal Kronenberg
Efficient Winning Strategies in Random-Turn Maker-Breaker Games. J. Graph Theory 85 (2) (2017)
Michael Krivelevich, Bojan Mohar
Editorial. J. Comb. Theory, Ser. B 121 (2016)
Malgorzata Bednarska-Bzdega, Dan Hefetz, Michael Krivelevich, Tomasz Luczak
Manipulative Waiters with Probabilistic Intuition. Comb. Probab. Comput. 25 (6) (2016)
Michael Krivelevich, Choongbum Lee, Benny Sudakov
Compatible Hamilton cycles in random graphs. Random Struct. Algorithms 49 (3) (2016)
Dan Hefetz, Michael Krivelevich, Alon Naor, Milos Stojakovic
On saturation games. Eur. J. Comb. 51 (2016)
Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira
Finding Hamilton cycles in random graphs with few queries. Random Struct. Algorithms 49 (4) (2016)
Dan Hefetz, Michael Krivelevich, Wei En Tan
Waiter-Client and Client-Waiter planarity, colorability and minor games. Discret. Math. 339 (5) (2016)
Nina Kamcev, Michael Krivelevich, Benny Sudakov
Some Remarks on Rainbow Connectivity. J. Graph Theory 83 (4) (2016)
Michael Krivelevich, Matthew Kwan, Benny Sudakov
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs. Comb. Probab. Comput. 25 (6) (2016)
Lior Gishboliner, Michael Krivelevich, Gal Kronenberg
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. CoRR (2016)
Michael Krivelevich
The Phase Transition in Site Percolation on Pseudo-Random Graphs. Electron. J. Comb. 23 (1) (2016)
Oren Dean, Michael Krivelevich
Client-Waiter Games on Complete and Random Graphs. Electron. J. Comb. 23 (4) (2016)
Florent Foucaud, Michael Krivelevich, Guillem Perarnau
Large Subgraphs without Short Cycles. SIAM J. Discret. Math. 29 (1) (2015)
Michael Krivelevich, Matthew Kwan, Benny Sudakov
Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electron. Notes Discret. Math. 49 (2015)
Dániel Korándi, Michael Krivelevich, Benny Sudakov
Decomposing Random Graphs into Few Cycles and Edges. Comb. Probab. Comput. 24 (6) (2015)
Lisa Espig, Alan M. Frieze, Michael Krivelevich, Wesley Pegden
Walker-Breaker Games. SIAM J. Discret. Math. 29 (3) (2015)
Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman
Contagious Sets in Expanders. SODA (2015)
Michael Krivelevich, Choongbum Lee, Benny Sudakov
Long paths and cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 46 (2) (2015)
Asaf Ferber, Roman Glebov, Michael Krivelevich, Alon Naor
Biased games on random boards. Random Struct. Algorithms 46 (4) (2015)
Nina Kamcev, Michael Krivelevich, Benny Sudakov
Some Remarks on Rainbow Connectivity. Electron. Notes Discret. Math. 49 (2015)
Asaf Ferber, Michael Krivelevich, Humberto Naves
Generating random graphs in biased Maker-Breaker games. Random Struct. Algorithms 47 (4) (2015)
Michael Krivelevich, Gal Kronenberg
Random-Player Maker-Breaker games. Electron. J. Comb. 22 (4) (2015)
Michael Krivelevich, Daniel Reichman, Wojciech Samotij
Smoothed Analysis on Connected Graphs. SIAM J. Discret. Math. 29 (3) (2015)
Roman Glebov, Michael Krivelevich, Tibor Szabó
On covering expander graphs by hamilton cycles. Random Struct. Algorithms 44 (2) (2014)
Michael Krivelevich, Wojciech Samotij
Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs. Electron. J. Comb. 21 (1) (2014)
Michael Krivelevich, Daniel Reichman, Wojciech Samotij
Smoothed Analysis on Connected Graphs. APPROX-RANDOM (2014)
Deepak Bal, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
Packing Tree Factors in Random and Pseudo-random Graphs. Electron. J. Comb. 21 (2) (2014)
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
Expanders Are Universal for the Class of All Spanning Trees. Comb. Probab. Comput. 22 (2) (2013)
Michael Krivelevich, Benny Sudakov
The phase transition in random graphs: A simple proof. Random Struct. Algorithms 43 (2) (2013)
Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron
Comparing the strength of query types in property testing: The case of k-colorability. Comput. Complex. 22 (1) (2013)
Asaf Ferber, Michael Krivelevich, Alon Naor
Avoider-Enforcer games played on edge disjoint hypergraphs. Discret. Math. 313 (24) (2013)
Alan M. Frieze, Michael Krivelevich
On the Non-Planarity of a Random Subgraph. Comb. Probab. Comput. 22 (5) (2013)
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
Longest cycles in sparse random digraphs. Random Struct. Algorithms 43 (1) (2013)
Roman Glebov, Michael Krivelevich
On the Number of Hamilton Cycles in Sparse Random Graphs. SIAM J. Discret. Math. 27 (1) (2013)
Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomás Valla, Máté Vizer
The Biased Odd Cycle Game. Electron. J. Comb. 20 (2) (2013)
Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman
Contagious Sets in Expanders. CoRR (2013)
Michael Krivelevich, Reto Spöhel
Creating Small Subgraphs in Achlioptas Processes With Growing Parameter. SIAM J. Discret. Math. 26 (2) (2012)
Dennis Clemens, Asaf Ferber, Michael Krivelevich, Anita Liebenau
Fast Strategies In Maker-Breaker Games Played on Random Boards. Comb. Probab. Comput. 21 (6) (2012)
Alan M. Frieze, Michael Krivelevich
Packing hamilton cycles in random and pseudo-random hypergraphs. Random Struct. Algorithms 41 (1) (2012)
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
Expanders are universal for the class of all spanning trees. SODA (2012)
Dan Hefetz, Michael Krivelevich, Tibor Szabó
Sharp threshold for the appearance of certain spanning trees in random graphs. Random Struct. Algorithms 41 (4) (2012)
Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg
Hierarchy Theorems for Property Testing. Comput. Complex. 21 (1) (2012)
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
The size Ramsey number of a directed path. J. Comb. Theory, Ser. B 102 (3) (2012)

Michael Krivelevich.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Krivelevich