Deepak Bal

32 papers Journal 32
YearRankTypeTitle / Venue / Authors
2026 J jnl
Generalized Ramsey numbers of cycles, paths, and hypergraphs.
Eur. J. Comb.
Deepak Bal, Patrick Bennett, Emily Heath, Shira Zerbib
2026 J jnl
On the multicolor Ramsey numbers of balanced double stars.
Discret. Math.
Deepak Bal, Louis DeBiasio, Ella Oren-Dahan
2025 J jnl
On the Number of Monochromatic Cliques in a Graph.
Electron. J. Comb.
Deepak Bal, Jonathan Cutler, Luke Pebody
2024 J jnl
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs.
Eur. J. Comb.
Deepak Bal, Louis DeBiasio, Allan Lo
2024 J jnl
Exploring the Dynamics of Lotka-Volterra Systems: Efficiency, Extinction Order, and Predictive Machine Learning.
CoRR
Sepideh Vafaie, Deepak Bal, Michael A. S. Thorne, Eric Forgoston
2024 J jnl
Full degree spanning trees in random regular graphs.
Discret. Appl. Math.
Sarah Acquaviva, Deepak Bal
2024 J jnl
Large monochromatic components in expansive hypergraphs.
Comb. Probab. Comput.
Deepak Bal, Louis DeBiasio
2024 J jnl
Large monochromatic components in hypergraphs with large minimum codegree.
J. Graph Theory
Deepak Bal, Louis DeBiasio
2024 J jnl
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\).
SIAM J. Discret. Math.
Deepak Bal, Alan M. Frieze, Pawel Pralat
2023 J jnl
The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs.
Electron. J. Comb.
Deepak Bal, Patrick Bennett
2022 J jnl
New Lower Bounds on the Size-Ramsey Number of a Path.
Electron. J. Comb.
Deepak Bal, Louis DeBiasio
2022 J jnl
Rainbow spanning trees in randomly coloured G
CoRR
Deepak Bal, Alan M. Frieze, Pawel Pralat
2021 J jnl
A note on a candy sharing game.
Art Discret. Appl. Math.
Deepak Bal, Joseph Degaetani
2021 J jnl
Finding tight Hamilton cycles in random hypergraphs faster.
Comb. Probab. Comput.
Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht
2021 J jnl
Hamiltonian Berge cycles in random hypergraphs.
Comb. Probab. Comput.
Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht
2021 J jnl
On the size Ramsey number of all cycles versus a path.
Discret. Math.
Deepak Bal, Ely Schudrich
2020 J jnl
A Ramsey property of random regular and k -out graphs.
J. Graph Theory
Michael Anastos, Deepak Bal
2020 J jnl
The Bipartite $K_{2, 2}$-Free Process and Bipartite Ramsey Number $b(2, t)$.
Electron. J. Comb.
Deepak Bal, Patrick Bennett
2018 J jnl
A greedy algorithm for finding a large 2-matching on a random cubic graph.
J. Graph Theory
Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
2017 J jnl
Partitioning Random Graphs into Monochromatic Components.
Electron. J. Comb.
Deepak Bal, Louis DeBiasio
2017 J jnl
Rainbow perfect matchings and Hamilton cycles in the random geometric graph.
Random Struct. Algorithms
Deepak Bal, Patrick Bennett, Xavier Pérez-Giménez, Pawel Pralat
2016 J jnl
Rainbow Arborescence in Random Digraphs.
J. Graph Theory
Deepak Bal, Patrick Bennett, Colin Cooper, Alan M. Frieze, Pawel Pralat
2016 J jnl
Rainbow matchings and Hamilton cycles in random graphs.
Random Struct. Algorithms
Deepak Bal, Alan M. Frieze
2016 J jnl
The Total Acquisition Number of Random Graphs.
Electron. J. Comb.
Deepak Bal, Patrick Bennett, Andrzej Dudek, Pawel Pralat
2015 J jnl
Lazy Cops and Robbers on Hypercubes.
Comb. Probab. Comput.
Deepak Bal, Anthony Bonato, William B. Kinnersley, Pawel Pralat
2015 J jnl
Power of k Choices and Rainbow Spanning Trees in Random Graphs.
Electron. J. Comb.
Deepak Bal, Patrick Bennett, Alan M. Frieze, Pawel Pralat
2014 J jnl
Packing Tree Factors in Random and Pseudo-random Graphs.
Electron. J. Comb.
Deepak Bal, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
2014 J jnl
The t-Tone Chromatic Number of Random Graphs.
Graphs Comb.
Deepak Bal, Patrick Bennett, Andrzej Dudek, Alan M. Frieze
2012 J jnl
A greedy algorithm for finding a large 2-matching on a random cubic graph
CoRR
Deepak Bal, Patrick Bennett, Tom Bohman, Alan M. Frieze
2012 J jnl
Packing Tight Hamilton Cycles in Uniform Hypergraphs.
SIAM J. Discret. Math.
Deepak Bal, Alan M. Frieze
2011 J jnl
On the maximum number of edges in a hypergraph with a unique perfect matching.
Discret. Math.
Deepak Bal, Andrzej Dudek, Zelealem B. Yilma
2008 J jnl
Graph connectivity, partial words, and a theorem of Fine and Wilf.
Inf. Comput.
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodia