Publications of Dhruv Mubayi
Turán problems and shadows I: Paths and cycles.
J. Combin. Theory Ser. A,
129:57--79, 2015.
MR3275114
Specified intersections.
Trans. Amer. Math. Soc.,
366(1):491--504, 2014.
MR3118403
On independent sets in hypergraphs.
Random Structures Algorithms,
44(2):224--239, 2014.
MR3158630
Multicolor Ramsey numbers for triple systems.
Discrete Math.,
322:69--77, 2014.
MR3164039
On generalized Ramsey numbers for 3-uniform hypergraphs.
J. Graph Theory,
76(3):217--223, 2014.
MR3200285
Counting independent sets in hypergraphs.
Combin. Probab. Comput.,
23(4):539--550, 2014.
MR3217359
A Ramsey-type result for geometric $\ell$-hypergraphs.
European J. Combin.,
41:232--241, 2014.
MR3219263
Multicolor Ramsey numbers for complete bipartite versus complete graphs.
J. Graph Theory,
77(1):19--38, 2014.
MR3231087
Counting independent sets in triangle-free graphs.
Proc. Amer. Math. Soc.,
142(10):3325--3334, 2014.
MR3238410
Spectral extremal problems for hypergraphs.
SIAM J. Discrete Math.,
28(4):1838--1854, 2014.
MR3270186
Coloring the cube with rainbow cycles.
Electron. J. Combin.,
20(2):Paper 4, 11, 2013.
MR3066343
Hypergraph Ramsey numbers: triangles versus cliques.
J. Combin. Theory Ser. A,
120(7):1491--1507, 2013.
MR3092679
Coloring simple hypergraphs.
J. Combin. Theory Ser. B,
103(6):767--794, 2013.
MR3127593
Counting substructures II: Hypergraphs.
Combinatorica,
33(5):591--612, 2013.
MR3132928
A Ramsey-type result for geometric $\ell$-hypergraphs.
In Graph drawing,
pages 364--375. Springer, Cham, 2013.
MR3162037
Coloring the cube with rainbow cycles.
Electronic journal of combinatorics,
10, 2013.
List coloring triangle-free hypergraphs.
Random structures and algorithms,
36, 2013.
Multicolor ramsey numbers for triple systems.
Siam Journal on Discrete Mathematics,
20, 2013.
Spectral extremal problems for hypergraphs.
Israel Journal of Mathematics,
20, 2013.
On even-degree subgraphs of linear hypergraphs.
Combin. Probab. Comput.,
21(1-2):113--127, 2012.
MR2900051
Two-part set systems.
Electron. J. Combin.,
19(1):Paper 52, 10, 2012.
MR2900427
The Turán number of $F_{3,3}$.
Combin. Probab. Comput.,
21(3):451--456, 2012.
MR2912791
Books versus triangles.
J. Graph Theory,
70(2):171--179, 2012.
MR2920997
Almost all triangle-free triple systems are tripartite.
Combinatorica,
32(2):143--169, 2012.
MR2927636
Tree-minimal graphs are almost regular.
J. Comb.,
3(1):49--62, 2012.
MR2975321
The de Bruijn-Erd\H os theorem for hypergraphs.
Des. Codes Cryptogr.,
65(3):233--245, 2012.
MR2988183
New lower bounds for the independence number of sparse graphs and hypergraphs.
SIAM J. Discrete Math.,
26(3):1134--1147, 2012.
MR3022131
Almost all triangle-free triple systems are tripartite.
Combinatorica,
1494-1518, 2012.
Books vs triangles.
Journal of Graph Theory,
8, 2012.
Counting substructures ii: hypergraphs.
Combinatorica,
57 pages, journal version is shorter, 2012.
The de bruijn-erdos theorem for hypergraphs .
Designs Codes and Cryptography,
20, 2012.
New lower bounds for the independence number of sparse graphs and hypergraphs.
SIAM Journal on Discrete Mathematics,
15, 2012.
On independent sets in hypergraphs.
Randoms Structures and Algorithms,
19, 2012.
Specified intersections.
Transactions of the American Mathematical Society,
19, 2012.
Counting independent sets in triangle-free graphs.
Proceedings of the American Mathematical Society,
12, 2012.
Tree-minimal graphs are almost regular.
Journal of Combinatorics,
, 2012.
On generalized ramsey numbers for 3-uniform hypergraphs.
Journal of Graph Theory,
6, 2012.
Eigenvalues and quasirandom hypergraphs.
Forum of Mathematics, Sigma,
38, 2012.
Hypergraph ramsey numbers: triangles versus cliques .
Journal of Combinatoial Theory, Series A,
19, 2012.
The poset of hypergraph quasirandomness.
Random Structures and Algorithms,
42, 2012.
Almost all triple systems with independent neighborhoods are semi-bipartite.
J. Combin. Theory Ser. A,
118(4):1494--1518, 2011.
MR2771596
On the chromatic threshold of hypergraphs.
Combinatorics, Probability and Computing,
36, 2011.
Multicolor ramsey numbers for complete bipartite versus complete graphs .
Journal of Graph Theory,
26, 2011.
Finding bipartite subgraphs efficiently.
Inform. Process. Lett.,
110(5):174--177, 2010.
MR2589565
Coloring $\mathcal H$-free hypergraphs.
Random Structures Algorithms,
36(1):11--25, 2010.
MR2591044
Set systems without a simplex or a cluster.
Combinatorica,
30(2):175--200, 2010.
MR2676834
Counting substructures I: color critical graphs.
Adv. Math.,
225(5):2731--2740, 2010.
MR2680181
Hypergraphs with independent neighborhoods.
Combinatorica,
30(3):277--293, 2010.
MR2728491
On approximate Horn formula minimization.
In Automata, languages and programming. Part I,
pages 438--450. Springer, Berlin, 2010.
MR2734604
Hypergraphs with independent neighborhoods.
Combinatorica,
277-293, 2010.
Simplex stability.
Combin. Probab. Comput.,
18(3):441--454, 2009.
MR2501436
Set systems with union and intersection constraints.
J. Combin. Theory Ser. B,
99(3):639--642, 2009.
MR2507945
Two-regular subgraphs of hypergraphs.
J. Combin. Theory Ser. B,
99(3):643--655, 2009.
MR2507946
Erd\H os-Ko-Rado in random hypergraphs.
Combin. Probab. Comput.,
18(5):629--646, 2009.
MR2534260
Bipartite coverings and the chromatic number.
Electron. J. Combin.,
16(1):Note 34, 5, 2009.
MR2574684
Combinatorial problems for Horn clauses.
In Graph theory, computational intelligence and thought,
pages 54--65. Springer, Berlin, 2009.
MR2721722
A new short proof of a theorem of Ahlswede and Khachatrian.
J. Combin. Theory Ser. A,
115(2):326--330, 2008.
MR2382520
Extremal problems for $t$-partite and $t$-colorable hypergraphs.
Electron. J. Combin.,
15(1):Research Paper 26, 9, 2008.
MR2383446
Constructions of non-principal families in extremal hypergraph theory.
Discrete Math.,
308(19):4430--4434, 2008.
MR2433770
On the chromatic number of simple triangle-free triple systems.
Electron. J. Combin.,
15(1):Research Paper 121, 27, 2008.
MR2443136
Quadruple systems with independent neighborhoods.
J. Combin. Theory Ser. A,
115(8):1552--1560, 2008.
MR2455593
When is an almost monochromatic $K_ 4$ guaranteed?.
Combin. Probab. Comput.,
17(6):823--830, 2008.
MR2463414
Coloring simple hypergraphs.
Journal of Combinatorial Theory, Series B,
, 2008.
Structure and stability of triangle-free set systems.
Trans. Amer. Math. Soc.,
359(1):275--291 (electronic), 2007.
MR2247891
On the chromatic number and independence number of hypergraph products.
J. Combin. Theory Ser. B,
97(1):151--155, 2007.
MR2278129
On the VC-dimension of uniform hypergraphs.
J. Algebraic Combin.,
25(1):101--110, 2007.
MR2284149
Rainbow Turán problems.
Combin. Probab. Comput.,
16(1):109--126, 2007.
MR2286514
The inverse protein folding problem on 2D and 3D lattices.
Discrete Appl. Math.,
155(6-7):719--732, 2007.
MR2309844
A new generalization of Mantel's theorem to $k$-graphs.
J. Combin. Theory Ser. B,
97(4):669--678, 2007.
MR2325805
Co-degree density of hypergraphs.
J. Combin. Theory Ser. A,
114(6):1118--1132, 2007.
MR2337241
Minimal paths and cycles in set systems.
European J. Combin.,
28(6):1681--1693, 2007.
MR2339494
On the independence number of the Erd\H os-Rényi and projective norm graphs and a related hypergraph.
J. Graph Theory,
56(2):113--127, 2007.
MR2350620
An intersection theorem for four sets.
Adv. Math.,
215(2):601--615, 2007.
MR2355601
Forbidding complete hypergraphs as traces.
Graphs Combin.,
23(6):667--679, 2007.
MR2365419
A hypergraph extension of Turán's theorem.
J. Combin. Theory Ser. B,
96(1):122--134, 2006.
MR2185983
The DNF exception problem.
Theoret. Comput. Sci.,
352(1-3):85--96, 2006.
MR2207510
Erd\H os-Ko-Rado for three sets.
J. Combin. Theory Ser. A,
113(3):547--550, 2006.
MR2209708
Explicit constructions of triple systems for Ramsey-Turán problems.
J. Graph Theory,
52(3):211--216, 2006.
MR2230833
Supersaturation for Ramsey-Turán problems.
Combinatorica,
26(3):315--332, 2006.
MR2246151
On the edge-bandwidth of graph products.
Theoret. Comput. Sci.,
359(1-3):43--57, 2006.
MR2251599
Set systems with no singleton intersection.
SIAM J. Discrete Math.,
20(4):1031--1041 (electronic), 2006.
MR2272245
Constructions of bipartite graphs from finite geometries.
J. Graph Theory,
49(1):1--10, 2005.
MR2130466
Non-uniform Turán-type problems.
J. Combin. Theory Ser. A,
111(1):106--110, 2005.
MR2144857
The co-degree density of the Fano plane.
J. Combin. Theory Ser. B,
95(2):333--337, 2005.
MR2171370
Proof of a conjecture of Erd\H os on triangles in set-systems.
Combinatorica,
25(5):599--614, 2005.
MR2176427
A hypergraph extension of the bipartite Turán problem.
J. Combin. Theory Ser. A,
106(2):237--253, 2004.
MR2021684
How many disjoint 2-edge paths must a cubic graph have?.
J. Graph Theory,
45(1):57--79, 2004.
MR2024816
An explicit construction for a Ramsey problem.
Combinatorica,
24(2):313--324, 2004.
MR2071338
Stability theorems for cancellative hypergraphs.
J. Combin. Theory Ser. B,
92(1):163--175, 2004.
MR2078500
Uniform edge distribution in hypergraphs is hereditary.
Electron. J. Combin.,
11(1):Research Paper 55, 32 pp. (electronic), 2004.
MR2097321
A family of switch equivalent graphs.
Discrete Math.,
288(1-3):29--35, 2004.
MR2101114
Efficient algorithms for the inverse protein folding problem on 2d and 3d lattices.
In 15th annual combinatorial pattern matching (Cpm) symposium, lncs,
pages 244--253. 2004.
Coloring with three-colored subgraphs.
J. Graph Theory,
42(3):193--198, 2003.
MR1958143
Erratum to: ``Minimal completely separating systems of $k$-sets'' [J. Combin. Theory Ser. A 93 (2001), no. 1, 192--198; MR1807121 (2002h:05158)].
J. Combin. Theory Ser. A,
103(2):403--404, 2003.
MR1996078
On a two-sided Turán problem.
Electron. J. Combin.,
10:Research Paper 42, 17 pp. (electronic), 2003.
MR2014529
On hypergraphs with every four points spanning at most two triples.
Electron. J. Combin.,
10:Note 10, 4 pp. (electronic), 2003.
MR2014538
New lower bounds for Ramsey numbers of graphs and hypergraphs.
Adv. in Appl. Math.,
28(3-4):544--559, 2002.
MR1900007
Some exact results and new asymptotics for hypergraph Turán numbers.
Combin. Probab. Comput.,
11(3):299--309, 2002.
MR1909504
The chromatic spectrum of mixed hypergraphs.
Graphs Combin.,
18(2):309--318, 2002.
MR1913672
On the Turán number of triple systems.
J. Combin. Theory Ser. A,
100(1):136--152, 2002.
MR1932073
On restricted edge-colorings of bicliques.
Discrete Math.,
257(2-3):513--529, 2002.
MR1935745
Generalizing the Ramsey problem through diameter.
Electron. J. Combin.,
9(1):Research Paper 42, 10 pp. (electronic), 2002.
MR1936864
Intersecting curves in the plane.
Graphs Combin.,
18(3):583--589, 2002.
MR1939076
Minimal completely separating systems of $k$-sets.
J. Combin. Theory Ser. A,
93(1):192--198, 2001.
MR1807121
On the chromatic number of set systems.
Random Structures Algorithms,
19(2):87--98, 2001.
MR1848784
Realizing degree imbalances in directed graphs.
Discrete Math.,
239(1-3):147--153, 2001.
MR1850993
Large induced forests in sparse graphs.
J. Graph Theory,
38(3):113--123, 2001.
MR1859785
Asymptotically optimal tree-packings in regular graphs.
Electron. J. Combin.,
8(1):Research Paper 38, 8 pp. (electronic), 2001.
MR1877657
Correction to: ``Edge-bandwidth of graphs'' [SIAM J. Discrete Math. 12 (1999), no. 3, 307--316 (Electronic); MR1710238 (2000e:05138)].
SIAM J. Discrete Math.,
13(1):1 (electronic), 2000.
MR1737929
Graphic sequences that have a realization with large clique number.
J. Graph Theory,
34(1):20--29, 2000.
MR1753064
On generalized Ramsey theory: the bipartite case.
J. Combin. Theory Ser. B,
79(1):66--86, 2000.
MR1757023
Multiple vertex coverings by specified induced subgraphs.
J. Graph Theory,
34(2):180--190, 2000.
MR1760423
New upper bounds for a canonical Ramsey problem.
Combinatorica,
20(1):141--146, 2000.
MR1770530
Edge-coloring cliques with many colors on subcliques.
Combinatorica,
20(3):441--444, 2000.
MR1774847
The edge-bandwidth of theta graphs.
J. Graph Theory,
35(2):89--98, 2000.
MR1781190
On the number of vertices with specified eccentricity.
Graphs Combin.,
16(4):441--452, 2000.
MR1804343
Signed domination in regular graphs and set-systems.
J. Combin. Theory Ser. B,
76(2):223--239, 1999.
MR1699254
Edge-bandwidth of graphs.
SIAM J. Discrete Math.,
12(3):307--316 (electronic), 1999.
MR1710238
Chromatic spectrum is broken.
In 6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1999),
pages 4 pp. (electronic). Elsevier, Amsterdam, 1999.
MR1966397
Connectivity and separating sets of cages.
J. Graph Theory,
29(1):35--44, 1998.
MR1633916
Edge-coloring cliques with three colors on all $4$-cliques.
Combinatorica,
18(2):293--296, 1998.
MR1656546