The following pages link to Michael Krivelevich (Q178700):
Displaying 50 items.
- Hierarchy Theorems for Property Testing (Q3638900) (← links)
- Large Nearly Regular Induced Subgraphs (Q3648501) (← links)
- (Q4250228) (← links)
- (Q4252044) (← links)
- <i>K<sup>s</sup></i>-Free Graphs Without Large <i>K<sup>r</sup></i>-Free Subgraphs (Q4314152) (← links)
- Subgraphs with a large cochromatic number (Q4351317) (← links)
- Triangle Factors in Random Graphs (Q4354592) (← links)
- Approximate Set Covering in Uniform Hypergraphs (Q4366877) (← links)
- Induced subgraphs of prescribed size (Q4422612) (← links)
- (Q4428908) (← links)
- The emergence of a giant component in random subgraphs of pseudo-random graphs (Q4446876) (← links)
- Adding random edges to dense graphs (Q4459584) (← links)
- Sharp thresholds for certain Ramsey properties of random graphs (Q4500481) (← links)
- Long cycles in critical graphs (Q4521488) (← links)
- Two‐coloring random hypergraphs (Q4543631) (← links)
- Clique coloring of dense random graphs (Q4581274) (← links)
- On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments (Q4584909) (← links)
- Positional Games (Q4589010) (← links)
- Finding and Using Expanders in Locally Sparse Graphs (Q4604650) (← links)
- The random <i>k</i>‐matching‐free process (Q4625024) (← links)
- On smoothed \(k\)-CNF formulas and the \texttt{Walksat} algorithm (Q4633854) (← links)
- On the trace of random walks on random graphs (Q4637998) (← links)
- Tight Bounds for Testing Bipartiteness in General Graphs (Q4651520) (← links)
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions (Q4655895) (← links)
- (Q4658950) (← links)
- Upper bounds on the rate of LDPC codes (Q4677565) (← links)
- The chromatic numbers of random hypergraphs (Q4705318) (← links)
- (Q4705344) (← links)
- (Q4716332) (← links)
- A Sharp Threshold for Network Reliability (Q4796015) (← links)
- The Largest Eigenvalue of Sparse Random Graphs (Q4796726) (← links)
- Sparse pseudo‐random graphs are Hamiltonian (Q4798125) (← links)
- On the probability of independent sets in random graphs (Q4798177) (← links)
- Algorithms with large domination ratio (Q4819698) (← links)
- Approximate coloring of uniform hypergraphs (Q4820902) (← links)
- Bounding Ramsey numbers through large deviation inequalities (Q4847400) (← links)
- Onk-saturated graphs with restrictions on the degrees (Q4892338) (← links)
- Optimal Packings of Hamilton Cycles in Sparse Random Graphs (Q4899037) (← links)
- Expanders Are Universal for the Class of All Spanning Trees (Q4911172) (← links)
- Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability (Q4933375) (← links)
- Hierarchy Theorems for Property Testing (Q4933380) (← links)
- Playing to Retain the Advantage (Q4933596) (← links)
- The Choice Number of Dense Random Graphs (Q4948043) (← links)
- Approximation algorithms and hardness results for cycle packing problems (Q4962688) (← links)
- Long paths and cycles in random subgraphs of graphs with large minimum degree (Q4982618) (← links)
- Edge-statistics on large graphs (Q4993086) (← links)
- The genus of the Erd\H{o}s-R\'enyi random graph and the fragile genus property (Q4993539) (← links)
- Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs (Q5067425) (← links)
- Complete Minors in Graphs Without Sparse Cuts (Q5068162) (← links)
- Rolling backwards can move you forward: On embedding problems in sparse expanders (Q5082387) (← links)
