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 2023 · math.COShow all

4 papers · 2 filters

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…