The following pages link to Michael Krivelevich (Q178700):
Displaying 50 items.
- Hitting time results for maker-breaker games (Q2909241) (← links)
- Creating small subgraphs in Achlioptas processes with growing parameter (Q2910943) (← links)
- Approximation algorithms for cycle packing problems (Q2921712) (← links)
- On the random 2-stage minimum spanning tree (Q2921759) (← links)
- A Construction of Almost Steiner Systems (Q2935201) (← links)
- Walker-Breaker Games (Q2944455) (← links)
- Smoothed Analysis on Connected Graphs (Q2947435) (← links)
- Rainbow Hamilton cycles in random graphs and hypergraphs (Q2957179) (← links)
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs (Q2957690) (← links)
- Smoothed Analysis on Connected Graphs (Q2969664) (← links)
- Regular induced subgraphs of a random Graph (Q2998889) (← links)
- Embedding Spanning Trees in Random Graphs (Q3013142) (← links)
- Equitable coloring of random graphs (Q3055766) (← links)
- Offline thresholds for Ramsey-type games on random graphs (Q3055878) (← links)
- A note on regular Ramsey graphs (Q3055921) (← links)
- Hamiltonicity thresholds in Achlioptas processes (Q3057066) (← links)
- Ramsey games with giants (Q3068759) (← links)
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 (Q3074554) (← links)
- Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs (Q3081327) (← links)
- Resilient Pancyclicity of Random and Pseudorandom Graphs (Q3084209) (← links)
- Sharp threshold for the appearance of certain spanning trees in random graphs (Q3145834) (← links)
- Fast Strategies In Maker–Breaker Games Played on Random Boards (Q3168447) (← links)
- Elegantly Colored Paths and Cycles in Edge Colored Random Graphs (Q3174699) (← links)
- Packing Hamilton Cycles Online (Q3177359) (← links)
- On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs (Q3225113) (← links)
- On the random 2-stage minimum spanning tree (Q3376662) (← links)
- Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (Q3386520) (← links)
- The Kőnig graph process (Q3386537) (← links)
- On smoothed analysis in dense graphs and formulas (Q3419587) (← links)
- Coloring complete bipartite graphs from random lists (Q3419602) (← links)
- Bounds on Distance Distributions in Codes of Given Size (Q3448741) (← links)
- Large Subgraphs without Short Cycles (Q3453565) (← links)
- Generating random graphs in biased Maker-Breaker games (Q3460510) (← links)
- Fast winning strategies in positional games (Q3503475) (← links)
- Small Sample Spaces Cannot Fool Low Degree Polynomials (Q3541801) (← links)
- Testing Reed–Muller Codes (Q3546491) (← links)
- Bounds on Distance Distributions in Codes of Known Size (Q3546504) (← links)
- Covering codes with improved density (Q3547185) (← links)
- On the Random Satisfiable Process (Q3552504) (← links)
- (Q3576756) (← links)
- (Q3579435) (← links)
- Testing triangle-freeness in general graphs (Q3581490) (← links)
- Solving random satisfiable 3CNF formulas in expected polynomial time (Q3581497) (← links)
- Why Almost All k-Colorable Graphs Are Easy (Q3590926) (← links)
- Corrigendum: On fractional K-factors of random graphs (Q3608308) (← links)
- A sharp threshold for the Hamilton cycle Maker–Breaker game (Q3608315) (← links)
- Avoiding small subgraphs in Achlioptas processes (Q3608317) (← links)
- Winning Fast in Sparse Graph Construction Games (Q3608334) (← links)
- Planarity, Colorability, and Minor Games (Q3614201) (← links)
- Testing Triangle-Freeness in General Graphs (Q3629476) (← links)
