32 results on '"Mubayi, Dhruv"'
Search Results
2. Coloring unions of nearly disjoint hypergraph cliques
3. Hypergraph Ramsey numbers of cliques versus stars
4. Independent sets in hypergraphs omitting an intersection
5. On a generalized Erdős–Rademacher problem
6. Polynomial to exponential transition in Ramsey theory
7. THE ERDŐS–SZEKERES PROBLEM AND AN INDUCED RAMSEY QUESTION
8. Constructions in Ramsey theory
9. New lower bounds for hypergraph Ramsey numbers
10. On the Size‐Ramsey Number of Hypergraphs
11. Multiple vertex coverings by specified induced subgraphs
12. Hamilton cycles in quasirandom hypergraphs
13. Hypergraph Ramsey numbers: tight cycles versus cliques
14. Coloring Triple Systems with Local Conditions
15. List coloring triangle-free hypergraphs
16. The poset of hypergraph quasirandomness
17. Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs
18. On Generalized Ramsey Numbers for 3-Uniform Hypergraphs
19. On independent sets in hypergraphs
20. Books Versus triangles
21. Coloring H-free hypergraphs
22. On the independence number of the Erdős-Rényi and projective norm graphs and a related hypergraph
23. Explicit constructions of triple systems for Ramsey–Turán problems
24. Constructions of bipartite graphs from finite geometries
25. How many disjoint 2‐edge paths must a cubic graph have?
26. Coloring with three-colored subgraphs
27. On the chromatic number of set systems
28. Large induced forests in sparse graphs
29. Graphic sequences that have a realization with large clique number
30. The edge-bandwidth of theta graphs
31. Multiple vertex coverings by specified induced subgraphs
32. Connectivity and separating sets of cages
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.