The following pages link to Michael Krivelevich (Q178700):
Displaying 50 items.
- Contagious sets in random graphs (Q1688015) (← links)
- Proper colouring painter-builder game (Q1690226) (← links)
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs (Q1775898) (← links)
- Deciding \(k\)-colorability in expected polynomial time (Q1847370) (← links)
- Hamilton cycles in random subgraphs of pseudo-random graphs (Q1849919) (← links)
- Choosability in random hypergraphs (Q1850565) (← links)
- On the concentration of eigenvalues of random symmetric matrices (Q1852724) (← links)
- Scalable secure storage when half the system is faulty (Q1854529) (← links)
- Colouring powers of cycles from random lists (Q1883608) (← links)
- On the edge distribution in triangle-free graphs (Q1892845) (← links)
- On a conjecture of Tuza about packing and covering of triangles (Q1896363) (← links)
- On a theorem of Lovász on covers in \(r\)-partite hypergraphs (Q1924486) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- The biased odd cycle game (Q1953485) (← links)
- List coloring of random and pseudo-random graphs (Q1977428) (← links)
- Cycle lengths in expanding graphs (Q2036619) (← links)
- On the performance of the depth first search algorithm in supercritical random graphs (Q2088713) (← links)
- Obituary: Robin Thomas (1962--2020) (Q2099405) (← links)
- Expansion in supercritical random subgraphs of the hypercube and its consequences (Q2105142) (← links)
- Every graph contains a linearly sized induced subgraph with all degrees odd (Q2161306) (← links)
- Ron Graham (1935--2020) (Q2200937) (← links)
- Random graph's Hamiltonicity is strongly tied to its minimum degree (Q2290359) (← links)
- Goldberg's conjecture is true for random multigraphs (Q2312622) (← links)
- Waiter-client and client-waiter Hamiltonicity games on random graphs (Q2357219) (← links)
- Avoider-Enforcer games (Q2371294) (← links)
- Addendum to ``Scalable secure storage when half the system is faulty'' [inform. comput. 174 (2)(2002) 203-213] (Q2373880) (← links)
- Long cycles in locally expanding graphs, with applications (Q2416516) (← links)
- Positional games (Q2438527) (← links)
- Fast winning strategies in maker-breaker games (Q2519013) (← links)
- Discrepancy games (Q2571294) (← links)
- Discrepancies of spanning trees and Hamilton cycles (Q2668020) (← links)
- Regular languages are testable with a constant number of queries (Q2706138) (← links)
- Random regular graphs of high degree (Q2746213) (← links)
- (Q2754130) (← links)
- (Q2754178) (← links)
- (Q2762790) (← links)
- Approximating coloring and maximum independent sets in 3-uniform hypergraphs (Q2765960) (← links)
- Approximating coloring and maximum independent sets in 3-uniform hypergraphs (Q2768313) (← links)
- Testing \(k\)-colorability (Q2784512) (← links)
- Compatible Hamilton cycles in random graphs (Q2830238) (← links)
- Longest cycles in sparse random digraphs (Q2844080) (← links)
- Avoider-Enforcer: the rules of the game (Q2851474) (← links)
- Playing to retain the advantage (Q2851498) (← links)
- The phase transition in random graphs: a simple proof (Q2852544) (← links)
- Fast embedding of spanning trees in biased maker-breaker games (Q2857367) (← links)
- Cores of random graphs are born Hamiltonian (Q2874667) (← links)
- Packing tight Hamilton cycles in 3-uniform hypergraphs (Q2884005) (← links)
- Variations on cops and robbers (Q2891049) (← links)
- Long cycles in subgraphs of (pseudo)random directed graphs (Q2897207) (← links)
- Packing Hamilton cycles in random and pseudo-random hypergraphs (Q2909240) (← links)
