582 results on '"Mubayi, Dhruv"'
Search Results
202. The co-degree density of the Fano plane
203. The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
204. Stability theorems for cancellative hypergraphs
205. A hypergraph extension of the bipartite Turán problem
206. A family of switch equivalent graphs
207. Extremal problems on ordered and convex geometric hypergraphs
208. Independence Number of Graphs with a Prescribed Number of Cliques
209. Hypergraphs Not Containing a Tight Tree with a Bounded Trunk
210. THE ERDŐS–SZEKERES PROBLEM AND AN INDUCED RAMSEY QUESTION
211. New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs
212. On the Turán Number of Triple Systems
213. Polynomial to exponential transition in Ramsey theory.
214. An Extremal Graph Problem with a Transcendental Solution
215. Multicolour Sunflowers
216. Constructions in Ramsey theory
217. New lower bounds for hypergraph Ramsey numbers
218. Chromatic spectrum is broken
219. Eigenvalues of non-regular linear quasirandom hypergraphs
220. On the Size‐Ramsey Number of Hypergraphs
221. The structure of large intersecting families
222. Hypergraph Ramsey numbers
223. An Extremal Graph Problem with a Transcendental Solution.
224. Multiple vertex coverings by specified induced subgraphs
225. Counting Trees in Graphs
226. Inverse Expander Mixing for Hypergraphs
227. Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques
228. Hamilton cycles in quasirandom hypergraphs
229. Coloring Sparse Hypergraphs
230. Hypergraph Ramsey numbers: tight cycles versus cliques
231. Sparse hypergraphs with low independence number
232. Perfect Packings in Quasirandom Hypergraphs II
233. New lower bounds for hypergraph Ramsey numbers.
234. Eigenvalues and Quasirandomness in Hypergraphs
235. Coloring Triple Systems with Local Conditions
236. On the Chromatic Thresholds of Hypergraphs
237. Books vs Triangles
238. Turán Problems and Shadows III: Expansions of Graphs
239. EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
240. The de Bruijn-Erdos Theorem for hypergraphs
241. A Ramsey-type result for geometricℓ-hypergraphs
242. Almost all cancellative triple systems are tripartite
243. Counting substructures II: triple systems
244. Biclique Coverings and the Chromatic Number
245. Counting substructures III: quadruple systems
246. THE STRUCTURE OF LARGE INTERSECTING FAMILIES.
247. List coloring triangle-free hypergraphs
248. Multicolor Ramsey numbers for triple systems
249. Counting Independent Sets in Hypergraphs
250. Spectral Extremal Problems for 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.