23 results on '"Krivelevich, Michael"'
Search Results
2. Component Games on Random Graphs
3. Cycle Lengths in Expanding Graphs
4. Optimal shattering of complex networks
5. Compatible Hamilton cycles in Dirac graphs
6. Comparing the strength of query types in property testing: The case of k-colorability
7. Hierarchy Theorems for Property Testing
8. Why Almost All k-Colorable Graphs Are Easy to Color
9. Fast Winning Strategies in Avoider-Enforcer Games
10. Hamilton cycles in highly connected and expanding graphs
11. Minors in Expanding Graphs
12. On two Hamilton cycle problems in random graphs
13. Embedding nearly-spanning bounded degree trees
14. Triangle Factors In Sparse Pseudo-Random Graphs
15. On the concentration of eigenvalues of random symmetric matrices
16. Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time
17. Efficient Testing of Large Graphs
18. List Coloring of Random and Pseudo-Random Graphs
19. The choice number of random bipartite graphs
20. The concentration of the chromatic number of random graphs
21. On the minimal number of edges in color-critical graphs
22. Constructive Bounds for a Ramsey-Type Problem
23. On a theorem of lovász on covers inr-partite hypergraphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.