Deepak Bal

activity

20112023

most citedHamiltonian Berge cycles in random hypergraphs

4 citations · 7 across the 13 of their papers we have counts for

collaborators

Showing math.COShow all

24 papers · 1 filter

math.CO2023

A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs

Deepak Bal, Louis DeBiasio, Allan Lo

The $r$ -color size-Ramsey number of a $k$ -uniform hypergraph $H$ , denoted by $R^_{r} (H)$ , is the minimum number of edges in a $k$ -uniform hypergraph $G$ such that for every $r$ -…

math.CO2023

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 $k$ -uniform $d$ -regular hypergraphs of large girth. As a result we obtain ne…

math.CO2023

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 $r$ -coloring of the complete $k$ -uniform hypergraph $K_{n}^{k}$ when $k \geq 2$ and…

math.CO2023

Large monochromatic components in hypergraphs with large minimum codegree

Deepak Bal, Louis DeBiasio

A result of Gyárfás says that for every $3$ -coloring of the edges of the complete graph $K_{n}$ , there is a monochromatic component of order at least $\frac{n}{2}$ , and this is best…

math.CO2022

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 $T$ of a graph $G$ ; that is, the number of vertices whose degree in $T$ equals its degree i…

math.CO2022

Rainbow spanning trees in randomly coloured $G_{k - o u t}$

Deepak Bal, Alan Frieze, Pawel Pralat

Given a graph $G = (V, E)$ on $n$ vertices and an assignment of colours to its edges, a set of edges $S \subseteq E$ is said to be rainbow if edges from $S$ have pairwise different co…

A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs

Larger matchings and independent sets in regular uniform hypergraphs of high girth

Large monochromatic components in expansive hypergraphs

Large monochromatic components in hypergraphs with large minimum codegree

Full Degree Spanning Trees in Random Regular Graphs

Rainbow spanning trees in randomly coloured Gk−out​

Rainbow spanning trees in randomly coloured $G_{k - o u t}$