49 results on '"Krivelevich, Michael"'
Search Results
2. On vertex Ramsey graphs with forbidden subgraphs
3. Largest subgraph from a hereditary property in a random graph
4. Robin Thomas (1962–2020)
5. Every graph contains a linearly sized induced subgraph with all degrees odd
6. Discrepancies of spanning trees and Hamilton cycles
7. Ron Graham (1935–2020)
8. Goldberg's conjecture is true for random multigraphs
9. Proper colouring Painter–Builder game
10. Waiter–Client and Client–Waiter Hamiltonicity games on random graphs
11. Counting and packing Hamilton cycles in dense graphs and oriented graphs
12. Editorial
13. Waiter–Client and Client–Waiter planarity, colorability and minor games
14. On saturation games
15. Some Remarks on Rainbow Connectivity
16. Cycles and matchings in randomly perturbed digraphs and hypergraphs
17. Avoider–Enforcer games played on edge disjoint hypergraphs
18. Fast embedding of spanning trees in biased Maker–Breaker games
19. Biased orientation games
20. The size Ramsey number of a directed path
21. Fast embedding of spanning trees in biased Maker-Breaker games
22. Global Maker–Breaker games on sparse graphs
23. Avoider–Enforcer: The rules of the game
24. Playing to retain the advantage
25. Avoider-Enforcer: The Rules of the Game
26. Random regular graphs of non-constant degree: Concentration of the chromatic number
27. Vertex percolation on expander graphs
28. Fast winning strategies in Maker–Breaker games
29. Fast winning strategies in positional games
30. Addendum to “Scalable secure storage when half the system is faulty” [Inform. Comput. 174 (2)(2002) 203–213]
31. Avoider–Enforcer games
32. Bart–Moe games, JumbleG and discrepancy
33. On packing Hamilton cycles in ε-regular graphs
34. Colouring powers of cycles from random lists
35. Algorithms with large domination ratio
36. Generalized hashing and parent-identifying codes
37. Approximate coloring of uniform hypergraphs
38. Maximum cuts and judicious partitions in graphs without short cycles
39. Hamilton cycles in random subgraphs of pseudo-random graphs
40. Scalable Secure Storage When Half the System Is Faulty
41. Deciding k-colorability in expected polynomial time
42. Choosability in Random Hypergraphs
43. Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
44. Coloring Graphs with Sparse Neighborhoods
45. Coloring random graphs
46. A lower bound for irredundant Ramsey numbers
47. Approximate Set Covering in Uniform Hypergraphs
48. Almost perfect matchings in random uniform hypergraphs
49. On a conjecture of Tuza about packing and covering of triangles
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.