183 results on '"Rödl, Vojtêch"'
Search Results
52. The chromatic number of finite type-graphs
53. The number of B3-sets of a given cardinality
54. A note on supersaturated set systems
55. Arrangeability and Clique Subdivisions
56. On generalized Ramsey numbers of Erdős and Rogers
57. An Improved Upper Bound on the Density of Universal Random Graphs
58. On the Function of Erdős and Rogers
59. A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
60. Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)
61. Coloring Uniform Hypergraphs with Small Edge Degrees
62. Regularity Lemmas for Graphs
63. SPECIFIED INTERSECTIONS
64. New Upper Bound on Vertex Folkman Numbers
65. Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
66. Chromatic Numbers and Homomorphisms of Large Girth Hypergraphs
67. Extremal Hypergraph Problems and the Regularity Method
68. The Generalization of Dirac’s Theorem for Hypergraphs
69. Maximal independent sets in the covering graph of the cube
70. Some recent results on Ramsey-type numbers
71. Efficient Testing of Hypergraphs : Extended Abstract
72. Near-optimum Universal Graphs for Graphs with Bounded Degrees : Extended Abstract
73. On Pisier Type Problems and Results (Combinatorial Applications to Number Theory)
74. Partite Construction and Ramsey Space Systems
75. Introduction Ramsey Theory Old and New
76. Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels
77. An Algorithmic Embedding of Graphs via Perfect Matchings
78. Arrangeability and Clique Subdivisions
79. Maximal independent sets in bipartite graphs obtained from Boolean lattices
80. On Canonical Ramsey Numbers for Coloring Three-Element Sets
81. Some constructive bounds on Ramsey numbers
82. Weak hypergraph regularity and linear hypergraphs
83. An almost quadratic bound on vertex Folkman numbers
84. On the number of graphs with a given endomorphism monoid
85. Some recollections on early work with Jan Pelant
86. Perfect matchings in large uniform hypergraphs with large minimum collective degree
87. On [formula omitted]-chromatically connected graphs
88. Strong Ramsey Theorems for Steiner Systems
89. Threshold Functions for Ramsey Properties
90. Two Proofs in Combinatorial Number Theory
91. On a Probabilistic Graph-Theoretical Method
92. Ramsey-type numbers involving graphs and hypergraphs with large girth
93. Note on the 3-graph counting lemma
94. Turán's theorem for pseudo-random graphs
95. A note on the jumping constant conjecture of Erdős
96. Small subsets inherit sparse ε-regularity
97. Perfect matchings in uniform hypergraphs with large minimum degree
98. Short paths in quasi-random triple systems with sparse underlying graphs
99. All Triangles are Ramsey
100. Independent Deuber sets in graphs on the natural numbers
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.