Deepak Bal

Orcid: 0000-0003-1441-1823

According to our database1, Deepak Bal authored at least 24 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\).
SIAM J. Discret. Math., March, 2024

Large monochromatic components in hypergraphs with large minimum codegree.
J. Graph Theory, March, 2024

2023
The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs.
Electron. J. Comb., 2023

2022
Rainbow spanning trees in randomly coloured G<sub>k-out</sub>.
CoRR, 2022

New Lower Bounds on the Size-Ramsey Number of a Path.
Electron. J. Comb., 2022

2021
On the size Ramsey number of all cycles versus a path.
Discret. Math., 2021

Finding tight Hamilton cycles in random hypergraphs faster.
Comb. Probab. Comput., 2021

Hamiltonian Berge cycles in random hypergraphs.
Comb. Probab. Comput., 2021

A note on a candy sharing game.
Art Discret. Appl. Math., 2021

2020
A Ramsey property of random regular and k -out graphs.
J. Graph Theory, 2020

The Bipartite $K_{2, 2}$-Free Process and Bipartite Ramsey Number $b(2, t)$.
Electron. J. Comb., 2020

2018
A greedy algorithm for finding a large 2-matching on a random cubic graph.
J. Graph Theory, 2018

2017
Rainbow perfect matchings and Hamilton cycles in the random geometric graph.
Random Struct. Algorithms, 2017

Partitioning Random Graphs into Monochromatic Components.
Electron. J. Comb., 2017

2016
Rainbow matchings and Hamilton cycles in random graphs.
Random Struct. Algorithms, 2016

Rainbow Arborescence in Random Digraphs.
J. Graph Theory, 2016

The Total Acquisition Number of Random Graphs.
Electron. J. Comb., 2016

2015
Lazy Cops and Robbers on Hypercubes.
Comb. Probab. Comput., 2015

Power of k Choices and Rainbow Spanning Trees in Random Graphs.
Electron. J. Comb., 2015

2014
The t-Tone Chromatic Number of Random Graphs.
Graphs Comb., 2014

Packing Tree Factors in Random and Pseudo-random Graphs.
Electron. J. Comb., 2014

2012
Packing Tight Hamilton Cycles in Uniform Hypergraphs.
SIAM J. Discret. Math., 2012

2011
On the maximum number of edges in a hypergraph with a unique perfect matching.
Discret. Math., 2011

2008
Graph connectivity, partial words, and a theorem of Fine and Wilf.
Inf. Comput., 2008


  Loading...