48 results on '"Rödl, Vojtêch"'
Search Results
2. Increasing paths in countable graphs
3. On Hamiltonian cycles in hypergraphs with dense link graphs
4. On local Turán problems
5. A Ramsey class for Steiner systems
6. The chromatic number of finite type-graphs
7. Embedding tetrahedra into quasirandom hypergraphs
8. The number of B3-sets of a given cardinality
9. Packing minor-closed families of graphs into complete graphs
10. On generalized Ramsey numbers of Erdős and Rogers
11. Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels
12. Some constructive bounds on Ramsey numbers
13. Weak hypergraph regularity and linear hypergraphs
14. An almost quadratic bound on vertex Folkman numbers
15. Perfect matchings in large uniform hypergraphs with large minimum collective degree
16. Turán's theorem for pseudo-random graphs
17. A note on the jumping constant conjecture of Erdős
18. Small subsets inherit sparse ε-regularity
19. Short paths in quasi-random triple systems with sparse underlying graphs
20. Independent Deuber sets in graphs on the natural numbers
21. Hypergraphs, Quasi-randomness, and Conditions for Regularity
22. On the Turán Number of Triple Systems
23. Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers
24. Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs
25. A note on Thomassenʼs conjecture
26. On the chromatic number and independence number of hypergraph products
27. On homogeneous sets of positive integers
28. Non-Ramsey Graphs Are c log n-Universal
29. Unbalanced steiner triple systems
30. The Erdős—Ko—Rado theorem for small families
31. Rigid linear binary codes
32. Partitions of finite relational and set systems
33. Note on decomposition of spheres in Hilbert spaces
34. Ramsey classes of set systems
35. An elementary proof of the canonizing version of Gallai-Witt's theorem
36. Multicolored Subsets in Colored Hypergraphs
37. On Ramsey sets in spheres
38. On the jumping constant conjecture for multigraphs
39. Ramsey Properties of Random Hypergraphs
40. On the minimum order of graphs with given semigroup
41. The Ramsey property for graphs with forbidden complete subgraphs
42. Chromatically optimal rigid graphs
43. On color critical graphs
44. A ramsey type problem concerning vertex colourings
45. A short proof of the existence of highly chromatic hypergraphs without short cycles
46. On Schur Properties of Random Subsets of Integers
47. On the Size of Set Systems on [n] Not Containing Weak (r, Δ)-Systems
48. Another proof of the Folkman-Rado-Sanders theorem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.