The following pages link to Michael Krivelevich (Q178700):
Displaying 50 items.
- Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
- Coloring random graphs (Q293318) (← links)
- Some remarks on rainbow connectivity (Q322204) (← links)
- Cycles and matchings in randomly perturbed digraphs and hypergraphs (Q322218) (← links)
- Counting and packing Hamilton cycles in dense graphs and oriented graphs (Q345082) (← links)
- Avoider-Enforcer games played on edge disjoint hypergraphs (Q394298) (← links)
- Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs (Q405113) (← links)
- Packing tree factors in random and pseudo-random graphs (Q405193) (← links)
- The size Ramsey number of a directed path (Q414648) (← links)
- Biased orientation games (Q418878) (← links)
- On the number of Hamilton cycles in pseudo-random graphs (Q426784) (← links)
- Fast embedding of spanning trees in biased maker-breaker games (Q427795) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
- On saturation games (Q499485) (← links)
- Client-waiter games on complete and random graphs (Q504971) (← links)
- Small subgraphs in the trace of a random walk (Q510343) (← links)
- The logic of random regular graphs (Q547871) (← links)
- Hamilton cycles in random geometric graphs (Q549867) (← links)
- Triangle factors in sparse pseudo-random graphs (Q558243) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- Hamilton cycles in highly connected and expanding graphs (Q624184) (← links)
- The number of \(F\)-matchings in almost every tree is a zero residue (Q625397) (← links)
- Compatible Hamilton cycles in Dirac graphs (Q681601) (← links)
- Fast winning strategies in avoider-enforcer games (Q844236) (← links)
- Bart--Moe games, JumbleG and discrepancy (Q875049) (← links)
- Random-player maker-breaker games (Q888617) (← links)
- The phase transition in site percolation on pseudo-random graphs (Q907264) (← links)
- On two Hamilton cycle problems in random graphs (Q948883) (← links)
- Embedding nearly-spanning bounded degree trees (Q950331) (← links)
- Avoider-enforcer: the rules of the game (Q966059) (← links)
- Why almost all \(k\)-colorable graphs are easy to color (Q968270) (← links)
- Vertex percolation on expander graphs (Q1003582) (← links)
- On rainbow trees and cycles (Q1010778) (← links)
- Biased positional games and small hypergraphs with large covers (Q1010790) (← links)
- Minors in expanding graphs (Q1028516) (← links)
- Perfectly balanced partitions of smoothed graphs (Q1028807) (← links)
- Random regular graphs of non-constant degree: concentration of the chromatic number (Q1043588) (← links)
- On the minimal number of edges in color-critical graphs (Q1272188) (← links)
- The concentration of the chromatic number of random graphs (Q1280244) (← links)
- The choice number of random bipartite graphs (Q1293418) (← links)
- Almost perfect matchings in random uniform hypergraphs (Q1363674) (← links)
- Constructive bounds for a Ramsey-type problem (Q1376057) (← links)
- An improved bound on the minimal number of edges in color-critical graphs (Q1379126) (← links)
- A lower bound for irredundant Ramsey numbers (Q1382826) (← links)
- Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
- Generalized hashing and parent-identifying codes. (Q1417959) (← links)
- Coloring graphs with sparse neighborhoods (Q1569053) (← links)
- Approximating the independence number and the chromatic number in expected polynomial time (Q1598877) (← links)
- Sparse graphs usually have exponentially many optimal colorings (Q1601114) (← links)
- Fractional planks (Q1611065) (← links)
