Dhruv Mubayi

From MaRDI portal
Person:168649

Available identifiers

zbMath Open mubayi.dhruvWikidataQ102164340 ScholiaQ102164340MaRDI QIDQ168649

List of research outcomes

PublicationDate of PublicationType
Ramsey numbers of cliques versus monotone paths2024-03-26Paper
A note on pseudorandom Ramsey graphs2024-03-11Paper
Coloring unions of nearly disjoint hypergraph cliques2024-01-29Paper
Extremal Problems for Hypergraph Blowups of Trees2023-10-26Paper
Independent sets in hypergraphs omitting an intersection2023-10-17Paper
Hypergraph Ramsey numbers of cliques versus stars2023-10-17Paper
On a generalized Erdős–Rademacher problem2023-10-05Paper
Ramsey numbers and the Zarankiewicz problem2023-07-17Paper
Large cliques or co-cliques in hypergraphs with forbidden order-size pairs2023-05-02Paper
On The Random Tur\'an number of linear cycles2023-04-28Paper
Triangles in graphs without bipartite suspensions2023-04-20Paper
Homogeneous sets in hypergraphs with forbidden order-size pairs2023-03-16Paper
A unified approach to hypergraph stability2022-11-28Paper
The feasible region of induced graphs2022-11-28Paper
A hypergraph Turán problem with no stability2022-11-09Paper
Tur\'{a}n problems in pseudorandom graphs2022-09-24Paper
Ramsey theory constructions from hypergraph matchings2022-08-26Paper
A note on the Erdős-Hajnal hypergraph Ramsey problem2022-07-08Paper
Set-coloring Ramsey numbers via codes2022-06-22Paper
Hypergraphs with infinitely many extremal constructions2022-06-08Paper
Extremal problems for pairs of triangles2022-04-27Paper
On explicit constructions of designs2022-04-04Paper
Cliques with many colors in triple systems2022-02-03Paper
Extremal problems for convex geometric hypergraphs and ordered hypergraphs2022-01-12Paper
A survey of hypergraph Ramsey problems2021-10-04Paper
Tight bounds for Katona's shadow intersection theorem2021-08-05Paper
Maximum \(\mathcal{H}\)-free subgraphs2021-07-23Paper
Polynomial to exponential transition in Ramsey theory2021-05-14Paper
The feasible region of hypergraphs2021-03-08Paper
Hypergraphs with many extremal configurations2021-02-03Paper
Extremal Theory of Locally Sparse Multigraphs2020-10-27Paper
Tight paths in convex geometric hypergraphs2020-10-20Paper
Partitioning ordered hypergraphs2020-10-07Paper
Ordered and convex geometric trees with linear extremal function2020-09-01Paper
Random Tur\'an theorem for hypergraph cycles2020-07-20Paper
The Erdős-Hajnal hypergraph Ramsey problem2020-05-07Paper
Triangles in graphs without bipartite suspensions2020-04-24Paper
Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 22020-04-01Paper
An Extremal Graph Problem with a Transcendental Solution2020-03-11Paper
DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS2020-01-10Paper
A hypergraph Tur\'{a}n problem with no stability2019-11-18Paper
The number of triple systems without even cycles2019-09-04Paper
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk2019-08-29Paper
Independence number of graphs with a prescribed number of cliques2019-05-20Paper
THE ERDŐS–SZEKERES PROBLEM AND AN INDUCED RAMSEY QUESTION2019-05-13Paper
Multicolour Sunflowers2018-11-09Paper
Extremal problems on ordered and convex geometric hypergraphs2018-07-13Paper
Constructions in Ramsey theory2018-05-03Paper
New lower bounds for hypergraph Ramsey numbers2018-04-24Paper
Sparse hypergraphs with low independence number2018-03-16Paper
A short proof of a lower bound for Tur\'an numbers2017-10-30Paper
On the Chromatic Thresholds of Hypergraphs2017-10-10Paper
Perfect Packings in Quasirandom Hypergraphs II2017-10-10Paper
Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques2017-10-10Paper
On the Size‐Ramsey Number of Hypergraphs2017-09-26Paper
Tight paths in convex geometric hypergraphs2017-09-04Paper
Off-diagonal hypergraph Ramsey numbers2017-05-26Paper
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems2017-03-28Paper
The structure of large intersecting families2017-03-27Paper
A survey of Turán problems for expansions2017-01-25Paper
Eigenvalues of non-regular linear quasirandom hypergraphs2016-12-14Paper
Turán problems and shadows. II: Trees2016-11-25Paper
The independent neighborhoods process2016-09-15Paper
Hamilton cycles in quasirandom hypergraphs2016-09-15Paper
Counting trees in graphs2016-09-13Paper
Coloring Sparse Hypergraphs2016-06-23Paper
Inverse expander mixing for hypergraphs2016-05-11Paper
Perfect packings in quasirandom hypergraphs. I.2016-04-21Paper
Coloring Triple Systems with Local Conditions2016-04-15Paper
Hypergraph Ramsey numbers: tight cycles versus cliques2016-02-22Paper
The number of trees in a graph2015-11-23Paper
List coloring triangle-free hypergraphs2015-11-13Paper
The poset of hypergraph quasirandomness2015-07-23Paper
Hypergraph Ramsey numbers: triangles versus cliques2015-06-19Paper
Turán Problems and Shadows III: Expansions of Graphs2015-06-08Paper
Spectral Extremal Problems for Hypergraphs2015-04-17Paper
EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS2015-01-28Paper
Counting substructures. II: Hypergraphs2015-01-09Paper
Turán problems and shadows. I: Paths and cycles2014-11-19Paper
Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs2014-10-09Paper
Counting independent sets in triangle-free graphs2014-09-16Paper
A Ramsey-type result for geometric \(\ell\)-hypergraphs2014-09-02Paper
On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs2014-08-07Paper
Counting Independent Sets in Hypergraphs2014-08-06Paper
On independent sets in hypergraphs2014-04-15Paper
Multicolor Ramsey numbers for triple systems2014-02-27Paper
Perfect Packings in Quasirandom Hypergraphs2014-02-04Paper
A Ramsey-Type Result for Geometric ℓ-Hypergraphs2013-12-20Paper
Specified intersections2013-11-14Paper
Tree-minimal graphs are almost regular2013-07-12Paper
Coloring the cube with rainbow cycles2013-06-07Paper
New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs2013-01-04Paper
The de Bruijn-Erdős theorem for hypergraphs2012-11-28Paper
On the chromatic number of simple triangle-free triple systems2012-11-15Paper
Almost all triangle-free triple systems are tripartite2012-09-17Paper
Two-part set systems2012-06-12Paper
The Turán Number ofF3,32012-06-04Paper
Books Versus triangles2012-06-04Paper
On Even-Degree Subgraphs of Linear Hypergraphs2012-05-14Paper
Hypergraphs with independent neighborhoods2011-12-19Paper
Set systems without a simplex or a cluster2011-04-26Paper
Almost all triple systems with independent neighborhoods are semi-bipartite2011-04-15Paper
Coloring H-free hypergraphs2010-11-10Paper
Counting substructures. I: Color critical graphs2010-10-07Paper
On Approximate Horn Formula Minimization2010-09-07Paper
Finding bipartite subgraphs efficiently2010-09-07Paper
The de Bruijn-Erdos Theorem for hypergraphs2010-06-03Paper
Toward a Hajnal-Szemeredi theorem for hypergraphs2010-05-21Paper
Simplex Stability2010-04-23Paper
Erdős–Ko–Rado in Random Hypergraphs2010-04-22Paper
Bipartite coverings and the chromatic number2010-03-26Paper
Combinatorial Problems for Horn Clauses2010-01-07Paper
Almost all cancellative triple systems are tripartite2009-10-15Paper
Set systems with union and intersection constraints2009-06-23Paper
Two-regular subgraphs of hypergraphs2009-06-23Paper
Counting substructures III: quadruple systems2009-05-28Paper
Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs2009-04-07Paper
On the chromatic number of simple triangle-free triple systems2009-04-07Paper
When is an Almost MonochromaticK4Guaranteed?2009-03-04Paper
Quadruple systems with independent neighborhoods2008-12-08Paper
Constructions of non-principal families in extremal hypergraph theory2008-09-04Paper
Forbidding complete hypergraphs as traces2008-03-14Paper
A new short proof of a theorem of Ahlswede and Khachatrian2008-03-06Paper
On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph2008-01-04Paper
Set Systems with No Singleton Intersection2007-11-16Paper
An intersection theorem for four sets2007-10-05Paper
Co-degree density of hypergraphs2007-08-20Paper
Minimal paths and cycles in set systems2007-07-27Paper
A new generalization of Mantel's theorem to \(k\)-graphs2007-06-08Paper
The inverse protein folding problem on 2D and 3D lattices2007-04-18Paper
Rainbow Turán Problems2007-03-20Paper
Structure and stability of triangle-free set systems2007-02-01Paper
On the chromatic number and independence number of hypergraph products2007-01-11Paper
Supersaturation for Ramsey-Turán problems2007-01-08Paper
On the VC-dimension of uniform hypergraphs2007-01-05Paper
Proof of a conjecture of Erdős on triangles in set-systems2007-01-02Paper
On the edge-bandwidth of graph products2006-09-14Paper
Explicit constructions of triple systems for Ramsey–Turán problems2006-09-06Paper
Erdős--Ko--Rado for three sets2006-04-28Paper
The DNF exception problem2006-03-24Paper
A hypergraph extension of Turán's theorem2006-01-10Paper
The co-degree density of the Fano plane2005-11-22Paper
Combinatorial Pattern Matching2005-09-07Paper
Non-uniform Turán-type problems2005-08-01Paper
Constructions of bipartite graphs from finite geometries2005-06-01Paper
An explicit construction for a Ramsey problem2005-02-14Paper
A family of switch equivalent graphs2005-01-13Paper
Uniform edge distribution in hypergraphs is hereditary2004-10-13Paper
Stability theorems for cancellative hypergraphs2004-10-01Paper
A hypergraph extension of the bipartite Turán problem2004-08-06Paper
On a two-sided Turán problem2004-02-05Paper
How many disjoint 2-edge paths must a cubic graph have?2004-02-03Paper
On hypergraphs with every four points spanning at most two triples2003-09-24Paper
Generalizing the Ramsey problem through diameter2003-05-13Paper
Coloring with three‐colored subgraphs2003-04-03Paper
On the Turán number of triple systems2003-03-26Paper
Intersecting curves in the plane2003-03-25Paper
On generalized Ramsey theory: The bipartite case2002-12-10Paper
On restricted edge-colorings of bicliques2002-12-02Paper
New lower bounds for Ramsey numbers of graphs and hypergraphs2002-09-12Paper
The chromatic spectrum of mixed hypergraphs2002-07-29Paper
On the number of vertices with specified eccentricity2002-07-22Paper
Large induced forests in sparse graphs2002-06-03Paper
Realizing degree imbalances in directed graphs2002-03-29Paper
Minimal completely separating systems of \(k\)-sets2002-02-17Paper
On the chromatic number of set systems2002-02-10Paper
Some Exact Results and New Asymptotics for Hypergraph Turán Numbers2002-01-01Paper
Asymptotically optimal tree-packings in regular graphs2001-12-11Paper
https://portal.mardi4nfdi.de/entity/Q27413432001-09-23Paper
https://portal.mardi4nfdi.de/entity/Q45183342001-06-21Paper
Edge-coloring cliques with many colors on subcliques2001-04-01Paper
https://portal.mardi4nfdi.de/entity/Q44894932001-02-18Paper
https://portal.mardi4nfdi.de/entity/Q44870722001-02-01Paper
New upper bounds for a canonical Ramsey problem2000-11-13Paper
Edge-Bandwidth of Graphs2000-04-10Paper
Signed domination in regular graphs and set-systems1999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42429261999-08-23Paper
Edge-coloring cliques with three colors on all 4-cliques1999-03-14Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Dhruv Mubayi