The following pages link to Michael Krivelevich (Q178700):
Displaying 50 items.
- Spanning Trees at the Connectivity Threshold (Q5093583) (← links)
- The genus of the Erdős‐Rényi random graph and the fragile genus property (Q5113933) (← links)
- Finding a Hamilton cycle fast on average using rotations and extensions (Q5120740) (← links)
- Asymptotics in percolation on high‐girth expanders (Q5128747) (← links)
- Very fast construction of bounded-degree spanning graphs via the semi-random graph process (Q5146812) (← links)
- Expanders – how to find them, and what to find in them (Q5149169) (← links)
- Spanning Directed Trees with Many Leaves (Q5189530) (← links)
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree (Q5190328) (← links)
- Semirandom Models as Benchmarks for Coloring Algorithms (Q5233148) (← links)
- Biased games on random boards (Q5265341) (← links)
- Efficient Winning Strategies in Random‐Turn Maker–Breaker Games (Q5272928) (← links)
- Long paths and Hamiltonicity in random graphs (Q5283764) (← links)
- On fractional <i>K</i>‐factors of random graphs (Q5297135) (← links)
- On the Number of Hamilton Cycles in Sparse Random Graphs (Q5300478) (← links)
- Contagious Sets in Expanders (Q5363074) (← links)
- Decomposing Random Graphs into Few Cycles and Edges (Q5364258) (← links)
- (Q5365089) (← links)
- (Q5365090) (← links)
- Manipulative Waiters with Probabilistic Intuition (Q5366922) (← links)
- Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs (Q5366926) (← links)
- Hamilton Cycles in Random Graphs with a Fixed Degree Sequence (Q5392910) (← links)
- On the Non-Planarity of a Random Subgraph (Q5397728) (← links)
- On covering expander graphs by hamilton cycles (Q5409861) (← links)
- Robust Hamiltonicity of Dirac graphs (Q5420107) (← links)
- Parameterized Algorithms for Directed Maximum Leaf Problems (Q5428822) (← links)
- The isoperimetric constant of the random graph process (Q5436979) (← links)
- On the Chromatic Number of Random Graphs with a Fixed Degree Sequence (Q5443802) (← links)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
- Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (Q5470697) (← links)
- The Strong Chromatic Index of Random Graphs (Q5470789) (← links)
- On the asymptotic value of the choice number of complete multi‐partite graphs (Q5471010) (← links)
- (Q5477817) (← links)
- Almost universal graphs (Q5486325) (← links)
- MaxCut in ${\bm H)$-Free Graphs (Q5704383) (← links)
- The Game of JumbleG (Q5704390) (← links)
- (Q5743497) (← links)
- (Q5874419) (← links)
- Large complete minors in random subgraphs (Q5886102) (← links)
- Short proofs for long induced paths (Q5886345) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900933) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900945) (← links)
- Efficient testing of large graphs (Q5932749) (← links)
- Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs (Q5963389) (← links)
- Oriented discrepancy of Hamilton cycles (Q6047963) (← links)
- The largest hole in sparse random graphs (Q6052472) (← links)
- Cycle lengths in sparse random graphs (Q6052480) (← links)
- Divisible subdivisions (Q6056761) (← links)
- Cycle lengths in randomly perturbed graphs (Q6063344) (← links)
- Complete minors and average degree: A short proof (Q6074598) (← links)
- The size‐Ramsey number of short subdivisions (Q6074649) (← links)
