Deepak Bal

From MaRDI portal
Person:344443

Available identifiers

zbMath Open bal.deepakMaRDI QIDQ344443

List of research outcomes





PublicationDate of PublicationType
Large monochromatic components in expansive hypergraphs2024-11-05Paper
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs2024-07-08Paper
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)2024-03-14Paper
Large monochromatic components in hypergraphs with large minimum codegree2024-01-30Paper
Larger matchings and independent sets in regular uniform hypergraphs of high girth2023-07-28Paper
Large monochromatic components in expansive hypergraphs2023-02-13Paper
The matching process and independent process in random regular graphs and hypergraphs2023-01-17Paper
Full Degree Spanning Trees in Random Regular Graphs2022-11-10Paper
New lower bounds on the size-Ramsey number of a path2022-02-01Paper
Hamiltonian Berge cycles in random hypergraphs2021-06-15Paper
On the size Ramsey number of all cycles versus a path2021-03-25Paper
A note on a candy sharing game2021-02-19Paper
Zero-forcing in random regular graphs2021-02-08Paper
The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\)2020-11-05Paper
A Ramsey property of random regular and k‐out graphs2020-05-21Paper
A greedy algorithm for finding a large 2‐matching on a random cubic graph2018-08-16Paper
Rainbow perfect matchings and Hamilton cycles in the random geometric graph2017-12-13Paper
Lazy Cops and Robbers on Hypercubes2017-10-04Paper
Partitioning random graphs into monochromatic components2017-02-17Paper
Lazy cops and robbers played on random graphs and graphs on surfaces2016-11-22Paper
Rainbow arborescence in random digraphs2016-11-16Paper
The total acquisition number of random graphs2016-07-06Paper
Rainbow matchings and Hamilton cycles in random graphs2016-06-10Paper
Power of \(k\) choices and rainbow spanning trees in random graphs2015-02-19Paper
The \(t\)-tone chromatic number of random graphs2014-09-19Paper
Packing tree factors in random and pseudo-random graphs2014-09-04Paper
On Sharp Thresholds of Monotone Properties: Bourgain's Proof Revisited2013-02-05Paper
Packing tight Hamilton cycles in uniform hypergraphs2012-09-12Paper
On the maximum number of edges in a hypergraph with a unique perfect matching2012-04-13Paper
A direct-numerical-simulation-based second-moment closure for turbulent magnetohydrodynamic flows2010-04-22Paper
Graph connectivity, partial words, and a theorem of Fine and Wilf2008-05-19Paper
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphsN/APaper
On the multicolor Ramsey numbers of balanced double starsN/APaper

Research outcomes over time

This page was built for person: Deepak Bal