4 citations · 7 across the 13 of their papers we have counts for
25 papers
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
Deepak Bal, Louis DeBiasio, Allan Lo
The -color size-Ramsey number of a -uniform hypergraph , denoted by , is the minimum number of edges in a -uniform hypergraph such that for every -…
Larger matchings and independent sets in regular uniform hypergraphs of high girth
Deepak Bal, Patrick Bennett
In this note we analyze two algorithms, one for producing a matching and one for an independent set, on -uniform -regular hypergraphs of large girth. As a result we obtain ne…
Large monochromatic components in expansive hypergraphs
Deepak Bal, Louis DeBiasio
A result of Gyárfás exactly determines the size of a largest monochromatic component in an arbitrary -coloring of the complete -uniform hypergraph when and…
Large monochromatic components in hypergraphs with large minimum codegree
Deepak Bal, Louis DeBiasio
A result of Gyárfás says that for every -coloring of the edges of the complete graph , there is a monochromatic component of order at least , and this is best…
Full Degree Spanning Trees in Random Regular Graphs
Sarah Acquaviva, Deepak Bal
We study the problem of maximizing the number of full degree vertices in a spanning tree of a graph ; that is, the number of vertices whose degree in equals its degree i…
Rainbow spanning trees in randomly coloured
Deepak Bal, Alan Frieze, Pawel Pralat
Given a graph on vertices and an assignment of colours to its edges, a set of edges is said to be rainbow if edges from have pairwise different co…