


Остановите войну!
for scientists:
Dhruv Mubayi
Person information

Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j121]Xizhi Liu, Dhruv Mubayi:
On Explicit Constructions of Designs. Electron. J. Comb. 29(1) (2022) - [j120]Xizhi Liu
, Dhruv Mubayi
:
On a generalized Erdős-Rademacher problem. J. Graph Theory 100(1): 101-126 (2022) - 2021
- [j119]Xizhi Liu, Dhruv Mubayi:
Tight bounds for Katona's shadow intersection theorem. Eur. J. Comb. 97: 103391 (2021) - [j118]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Partitioning ordered hypergraphs. J. Comb. Theory, Ser. A 177: 105300 (2021) - [j117]Xizhi Liu
, Dhruv Mubayi:
The feasible region of hypergraphs. J. Comb. Theory, Ser. B 148: 23-59 (2021) - 2020
- [j116]Zoltán Füredi
, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2. Discret. Appl. Math. 276: 50-59 (2020) - [j115]Zoltán Füredi, Alexandr V. Kostochka
, Dhruv Mubayi, Jacques Verstraëte:
Ordered and Convex Geometric Trees with Linear Extremal Function. Discret. Comput. Geom. 64(2): 324-338 (2020) - [j114]Dhruv Mubayi, Caroline Terry:
Extremal Theory of Locally Sparse Multigraphs. SIAM J. Discret. Math. 34(3): 1922-1943 (2020)
2010 – 2019
- 2019
- [j113]Dhruv Mubayi, Lujia Wang:
The Number of Triple Systems Without Even Cycles. Comb. 39(3): 679-704 (2019) - [j112]Tom Bohman, Dhruv Mubayi:
Independence Number of Graphs with a Prescribed Number of Cliques. Electron. J. Comb. 26(2): P2.25 (2019) - [j111]Dhruv Mubayi, Caroline Terry:
An Extremal Graph Problem with a Transcendental Solution. Comb. Probab. Comput. 28(2): 303-324 (2019) - [j110]Dhruv Mubayi, Caroline Terry:
Discrete Metric Spaces: Structure, Enumeration, and 0-1 Laws. J. Symb. Log. 84(4): 1293-1325 (2019) - [j109]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk. SIAM J. Discret. Math. 33(2): 862-873 (2019) - [i2]Dhruv Mubayi, Jacques Verstraëte:
A note on Pseudorandom Ramsey graphs. CoRR abs/1909.01461 (2019) - 2018
- [j108]Dhruv Mubayi, Lujia Wang:
Multicolour Sunflowers. Comb. Probab. Comput. 27(6): 974-987 (2018) - [j107]Dhruv Mubayi, Andrew Suk:
Constructions in Ramsey theory. J. Lond. Math. Soc. 97(2): 247-257 (2018) - 2017
- [j106]Jeff Cooper, Dhruv Mubayi:
Sparse hypergraphs with low independence number. Comb. 37(1): 31-40 (2017) - [j105]John Lenz, Dhruv Mubayi:
Eigenvalues of non-regular linear quasirandom hypergraphs. Discret. Math. 340(2): 145-153 (2017) - [j104]Dhruv Mubayi:
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems. Eur. J. Comb. 62: 197-205 (2017) - [j103]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán problems and shadows II: Trees. J. Comb. Theory, Ser. B 122: 457-478 (2017) - [j102]Dhruv Mubayi, Andrew Suk:
Off-diagonal hypergraph Ramsey numbers. J. Comb. Theory, Ser. B 125: 168-177 (2017) - [j101]Andrzej Dudek, Steve La Fleur, Dhruv Mubayi, Vojtech Rödl:
On the Size-Ramsey Number of Hypergraphs. J. Graph Theory 86(1): 104-121 (2017) - 2016
- [j100]Emma Cohen, Dhruv Mubayi, Peter Ralli, Prasad Tetali:
Inverse Expander Mixing for Hypergraphs. Electron. J. Comb. 23(2): P2.20 (2016) - [j99]Jacques Verstraëte, Dhruv Mubayi:
Counting Trees in Graphs. Electron. J. Comb. 23(3): P3.39 (2016) - [j98]József Balogh, Jane Butterfield, Ping Hu
, John Lenz, Dhruv Mubayi:
On the Chromatic Thresholds of Hypergraphs. Comb. Probab. Comput. 25(2): 172-212 (2016) - [j97]John Lenz, Dhruv Mubayi:
Perfect Packings in Quasirandom Hypergraphs II. Comb. Probab. Comput. 25(4): 595-611 (2016) - [j96]Dhruv Mubayi:
Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques. Comb. Probab. Comput. 25(5): 791-796 (2016) - [j95]John Lenz, Dhruv Mubayi:
Perfect packings in quasirandom hypergraphs I. J. Comb. Theory, Ser. B 119: 155-177 (2016) - [j94]Dhruv Mubayi:
Coloring Triple Systems with Local Conditions. J. Graph Theory 81(3): 307-311 (2016) - [j93]John Lenz, Dhruv Mubayi, Richard Mycroft:
Hamilton cycles in quasirandom hypergraphs. Random Struct. Algorithms 49(2): 363-378 (2016) - [j92]Jeff Cooper, Dhruv Mubayi:
Coloring Sparse Hypergraphs. SIAM J. Discret. Math. 30(2): 1165-1180 (2016) - 2015
- [j91]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán problems and shadows I: Paths and cycles. J. Comb. Theory, Ser. A 129: 57-79 (2015) - [j90]John Lenz, Dhruv Mubayi:
The poset of hypergraph quasirandomness. Random Struct. Algorithms 46(4): 762-800 (2015) - [j89]Jeff Cooper, Dhruv Mubayi:
List coloring triangle-free hypergraphs. Random Struct. Algorithms 47(3): 487-519 (2015) - [j88]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán Problems and Shadows III: Expansions of Graphs. SIAM J. Discret. Math. 29(2): 868-876 (2015) - 2014
- [j87]Jeff Cooper, Kunal Dutta, Dhruv Mubayi:
Counting Independent Sets in Hypergraphs. Comb. Probab. Comput. 23(4): 539-550 (2014) - [j86]Maria Axenovich, András Gyárfás, Hong Liu, Dhruv Mubayi:
Multicolor Ramsey numbers for triple systems. Discret. Math. 322: 69-77 (2014) - [j85]Dhruv Mubayi, Andrew Suk:
A Ramsey-type result for geometric l-hypergraphs. Eur. J. Comb. 41: 232-241 (2014) - [j84]Andrzej Dudek, Dhruv Mubayi:
On Generalized Ramsey Numbers for 3-Uniform Hypergraphs. J. Graph Theory 76(3): 217-223 (2014) - [j83]John Lenz, Dhruv Mubayi:
Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs. J. Graph Theory 77(1): 19-38 (2014) - [j82]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
On independent sets in hypergraphs. Random Struct. Algorithms 44(2): 224-239 (2014) - [j81]Peter Keevash, John Lenz, Dhruv Mubayi:
Spectral Extremal Problems for Hypergraphs. SIAM J. Discret. Math. 28(4): 1838-1854 (2014) - 2013
- [j80]Dhruv Mubayi:
Counting substructures II: Hypergraphs. Comb. 33(5): 591-612 (2013) - [j79]Dhruv Mubayi, Randall Stading:
Coloring the Cube with Rainbow Cycles. Electron. J. Comb. 20(2): P4 (2013) - [j78]Alan M. Frieze
, Dhruv Mubayi:
Coloring simple hypergraphs. J. Comb. Theory, Ser. B 103(6): 767-794 (2013) - [j77]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Hypergraph Ramsey numbers: Triangles versus cliques. J. Comb. Theory, Ser. A 120(7): 1491-1507 (2013) - [c5]Dhruv Mubayi, Andrew Suk:
A Ramsey-Type Result for Geometric ℓ-Hypergraphs. Graph Drawing 2013: 364-375 - [i1]Jeff Cooper, Kunal Dutta, Dhruv Mubayi:
Counting independent sets in hypergraphs. CoRR abs/1310.6672 (2013) - 2012
- [j76]József Balogh, Dhruv Mubayi:
Almost all triangle-free triple systems are tripartite. Comb. 32(2): 143-169 (2012) - [j75]Péter L. Erdös, Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer, Balázs Patkós:
Two-Part Set Systems. Electron. J. Comb. 19(1): P52 (2012) - [j74]Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak
, Dhruv Mubayi, Brendan Nagle, Yury Person
, Vojtech Rödl, Mathias Schacht
, Jacques Verstraëte:
On Even-Degree Subgraphs of Linear Hypergraphs. Comb. Probab. Comput. 21(1-2): 113-127 (2012) - [j73]Peter Keevash, Dhruv Mubayi:
The Turán Number of F3, 3. Comb. Probab. Comput. 21(3): 451-456 (2012) - [j72]Noga Alon, Keith E. Mellinger, Dhruv Mubayi, Jacques Verstraëte:
The de Bruijn-Erdős theorem for hypergraphs. Des. Codes Cryptogr. 65(3): 233-245 (2012) - [j71]Dhruv Mubayi:
Books Versus triangles. J. Graph Theory 70(2): 171-179 (2012) - [j70]Kunal Dutta, Dhruv Mubayi, C. R. Subramanian:
New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs. SIAM J. Discret. Math. 26(3): 1134-1147 (2012) - 2011
- [j69]József Balogh, Dhruv Mubayi:
Almost all triple systems with independent neighborhoods are semi-bipartite. J. Comb. Theory, Ser. A 118(4): 1494-1518 (2011) - 2010
- [j68]Peter Keevash, Dhruv Mubayi:
Set systems without a simplex or a cluster. Comb. 30(2): 175-200 (2010) - [j67]Tom Bohman
, Alan M. Frieze
, Dhruv Mubayi, Oleg Pikhurko:
Hypergraphs with independent neighborhoods. Comb. 30(3): 277-293 (2010) - [j66]Dhruv Mubayi, György Turán:
Finding bipartite subgraphs efficiently. Inf. Process. Lett. 110(5): 174-177 (2010) - [j65]Tom Bohman
, Alan M. Frieze
, Dhruv Mubayi:
Coloring H-free hypergraphs. Random Struct. Algorithms 36(1): 11-25 (2010) - [c4]Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán:
On Approximate Horn Formula Minimization. ICALP (1) 2010: 438-450
2000 – 2009
- 2009
- [j64]Dhruv Mubayi, Sundar Vishwanathan:
Bipartite Coverings and the Chromatic Number. Electron. J. Comb. 16(1) (2009) - [j63]Dhruv Mubayi, Reshma Ramadurai
:
Simplex Stability. Comb. Probab. Comput. 18(3): 441-454 (2009) - [j62]József Balogh, Tom Bohman
, Dhruv Mubayi:
Erdos-Ko-Rado in Random Hypergraphs. Comb. Probab. Comput. 18(5): 629-646 (2009) - [j61]Dhruv Mubayi, Reshma Ramadurai
:
Set systems with union and intersection constraints. J. Comb. Theory, Ser. B 99(3): 639-642 (2009) - [j60]Dhruv Mubayi, Jacques Verstraëte:
Two-regular subgraphs of hypergraphs. J. Comb. Theory, Ser. B 99(3): 643-655 (2009) - [c3]Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán:
Combinatorial Problems for Horn Clauses. Graph Theory, Computational Intelligence and Thought 2009: 54-65 - 2008
- [j59]Alan M. Frieze, Dhruv Mubayi:
On the Chromatic Number of Simple Triangle-Free Triple Systems. Electron. J. Comb. 15(1) (2008) - [j58]Dhruv Mubayi, John M. Talbot:
Extremal Problems for t-Partite and t-Colorable Hypergraphs. Electron. J. Comb. 15(1) (2008) - [j57]Alexandr V. Kostochka, Dhruv Mubayi:
When is an Almost Monochromatic K4 Guaranteed? Comb. Probab. Comput. 17(6): 823-830 (2008) - [j56]Dhruv Mubayi, Oleg Pikhurko:
Constructions of non-principal families in extremal hypergraph theory. Discret. Math. 308(19): 4430-4434 (2008) - [j55]József Balogh, Dhruv Mubayi:
A new short proof of a theorem of Ahlswede and Khachatrian. J. Comb. Theory, Ser. A 115(2): 326-330 (2008) - [j54]Zoltán Füredi, Dhruv Mubayi, Oleg Pikhurko:
Quadruple systems with independent neighborhoods. J. Comb. Theory, Ser. A 115(8): 1552-1560 (2008) - [c2]Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán:
Combinatorial problems for Horn clauses. ISAIM 2008 - 2007
- [j53]Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte:
Rainbow Turán Problems. Comb. Probab. Comput. 16(1): 109-126 (2007) - [j52]Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The inverse protein folding problem on 2D and 3D lattices. Discret. Appl. Math. 155(6-7): 719-732 (2007) - [j51]Dhruv Mubayi, Jacques Verstraëte:
Minimal paths and cycles in set systems. Eur. J. Comb. 28(6): 1681-1693 (2007) - [j50]Dhruv Mubayi, Yi Zhao:
Forbidding Complete Hypergraphs as Traces. Graphs Comb. 23(6): 667-679 (2007) - [j49]Dhruv Mubayi, Vojtech Rödl:
On the chromatic number and independence number of hypergraph products. J. Comb. Theory, Ser. B 97(1): 151-155 (2007) - [j48]Dhruv Mubayi, Oleg Pikhurko:
A new generalization of Mantel's theorem to k-graphs. J. Comb. Theory, Ser. B 97(4): 669-678 (2007) - [j47]Dhruv Mubayi, Yi Zhao:
Co-degree density of hypergraphs. J. Comb. Theory, Ser. A 114(6): 1118-1132 (2007) - [j46]Dhruv Mubayi, Jason Williford:
On the independence number of the Erdös-Rényi and projective norm graphs and a related hypergraph. J. Graph Theory 56(2): 113-127 (2007) - 2006
- [j45]Dhruv Mubayi, Vojtech Rödl:
Supersaturation For Ramsey-Turán Problems. Comb. 26(3): 315-332 (2006) - [j44]Dhruv Mubayi:
A hypergraph extension of Turán's theorem. J. Comb. Theory, Ser. B 96(1): 122-134 (2006) - [j43]Dhruv Mubayi:
Erdos-Ko-Rado for three sets. J. Comb. Theory, Ser. A 113(3): 547-550 (2006) - [j42]Dhruv Mubayi, Vera T. Sós:
Explicit constructions of triple systems for Ramsey-Turán problems. J. Graph Theory 52(3): 211-216 (2006) - [j41]Peter Keevash, Dhruv Mubayi, Richard M. Wilson:
Set Systems with No Singleton Intersection. SIAM J. Discret. Math. 20(4): 1031-1041 (2006) - [j40]Dhruv Mubayi, György Turán, Yi Zhao:
The DNF exception problem. Theor. Comput. Sci. 352(1-3): 85-96 (2006) - [j39]József Balogh, Dhruv Mubayi, András Pluhár:
On the edge-bandwidth of graph products. Theor. Comput. Sci. 359(1-3): 43-57 (2006) - 2005
- [j38]Dhruv Mubayi, Jacques Verstraëte:
Proof Of A Conjecture Of Erdös On Triangles In Set-Systems. Comb. 25(5): 599-614 (2005) - [j37]Dhruv Mubayi:
The co-degree density of the Fano plane. J. Comb. Theory, Ser. B 95(2): 333-337 (2005) - [j36]Dhruv Mubayi, Yi Zhao:
Non-uniform Turán-type problems. J. Comb. Theory, Ser. A 111(1): 106-110 (2005) - [j35]Keith E. Mellinger, Dhruv Mubayi:
Constructions of bipartite graphs from finite geometries. J. Graph Theory 49(1): 1-10 (2005) - 2004
- [j34]Dhruv Mubayi:
An Explicit Construction for a Ramsey Problem. Comb. 24(2): 313-324 (2004) - [j33]Dhruv Mubayi, Vojtech Rödl:
Uniform Edge Distribution in Hypergraphs is Hereditary. Electron. J. Comb. 11(1) (2004) - [j32]Bertrand Guenin, Dhruv Mubayi, Prasad Tetali:
A family of switch equivalent graphs. Discret. Math. 288(1-3): 29-35 (2004) - [j31]Peter Keevash, Dhruv Mubayi:
Stability theorems for cancellative hypergraphs. J. Comb. Theory, Ser. B 92(1): 163-175 (2004) - [j30]Dhruv Mubayi, Jacques Verstraëte:
A hypergraph extension of the bipartite Turán problem. J. Comb. Theory, Ser. A 106(2): 237-253 (2004) - [j29]Alexander K. Kelmans, Dhruv Mubayi:
How many disjoint 2-edge paths must a cubic graph have? J. Graph Theory 45(1): 57-79 (2004) - [c1]Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. CPM 2004: 244-253 - 2003
- [j28]Dhruv Mubayi:
On Hypergraphs with Every Four Points Spanning at Most Two Triples. Electron. J. Comb. 10 (2003) - [j27]Dhruv Mubayi, Yi Zhao:
On a Two-Sided Turan Problem. Electron. J. Comb. 10 (2003) - [j26]Dhruv Mubayi:
Coloring with three-colored subgraphs. J. Graph Theory 42(3): 193-198 (2003) - 2002
- [j25]Felix Lazebnik, Dhruv Mubayi:
New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs. Adv. Appl. Math. 28(3-4): 544-559 (2002) - [j24]Dhruv Mubayi:
Generalizing the Ramsey Problem through Diameter. Electron. J. Comb. 9(1) (2002) - [j23]Dhruv Mubayi:
Some Exact Results And New Asymptotics For Hypergraph Turán Numbers. Comb. Probab. Comput. 11(3): 299-309 (2002) - [j22]Dhruv Mubayi, Douglas B. West:
On restricted edge-colorings of bicliques. Discret. Math. 257(2-3): 513-529 (2002) - [j21]Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West:
The Chromatic Spectrum of Mixed Hypergraphs. Graphs Comb. 18(2): 309-318 (2002) - [j20]Dhruv Mubayi:
Intersecting Curves in the Plane. Graphs Comb. 18(3): 583-589 (2002) - [j19]Dhruv Mubayi, Vojtech Rödl:
On the Turán Number of Triple Systems. J. Comb. Theory, Ser. A 100(1): 136-152 (2002) - 2001
- [j18]Alexander K. Kelmans, Dhruv Mubayi, Benny Sudakov:
Asymptotically Optimal Tree-Packings in Regular Graphs. Electron. J. Comb. 8(1) (2001) - [j17]Dhruv Mubayi, Todd G. Will, Douglas B. West:
Realizing degree imbalances in directed graphs. Discret. Math. 239(1-3): 147-153 (2001) - [j16]André Kündgen
, Dhruv Mubayi, Prasad Tetali:
Minimal Completely Separating Systems of k-Sets. J. Comb. Theory, Ser. A 93(1): 192-198 (2001) - [j15]Noga Alon, Dhruv Mubayi, Robin Thomas:
Large induced forests in sparse graphs. J. Graph Theory 38(3): 113-123 (2001) - [j14]Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali:
On the chromatic number of set systems. Random Struct. Algorithms 19(2): 87-98 (2001) - 2000
- [j13]Tao Jiang, Dhruv Mubayi:
New Upper Bounds for a Canonical Ramsey Problem. Comb. 20(1): 141-146 (2000) - [j12]Dennis Eichhorn, Dhruv Mubayi:
Edge-Coloring Cliques with Many Colors on Subcliques. Comb. 20(3): 441-444 (2000) - [j11]Dhruv Mubayi, Douglas B. West:
On the Number of Vertices with Specified Eccentricity. Graphs Comb. 16(4): 441-452 (2000) - [j10]Maria Axenovich, Zoltán Füredi, Dhruv Mubayi:
On Generalized Ramsey Theory: The Bipartite Case. J. Comb. Theory, Ser. B 79(1): 66-86 (2000) - [j9]Dhruv Mubayi:
Graphic sequences that have a realization with large clique number. J. Graph Theory 34(1): 20-29 (2000) - [j8]Zoltán Füredi, Dhruv Mubayi, Douglas B. West:
Multiple vertex coverings by specified induced subgraphs. J. Graph Theory 34(2): 180-190 (2000) - [j7]Dennis Eichhorn, Dhruv Mubayi, Kevin O'Bryant, Douglas B. West:
The edge-bandwidth of theta graphs. J. Graph Theory 35(2): 89-98 (2000) - [j6]Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West:
Correction to Edge-Bandwidth of Graphs. SIAM J. Discret. Math. 13(1): 1 (2000)
1990 – 1999
- 1999
- [j5]Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West:
Chromatic spectrum is broken. Electron. Notes Discret. Math. 3: 86-89 (1999) - [j4]