Deepak Bal

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Edge-coloring $K_{n, n}$ with no 2-colored $C_{2 k}$

Deepak Bal, Patrick Bennett

The generalized Ramsey number $r (G, H, q)$ is the minimum number of colors needed to color the edges of $G$ such that every isomorphic copy of $H$ has at least $q$ colors. In this…

math.CO2024

Generalized Ramsey numbers of cycles, paths, and hypergraphs

Deepak Bal, Patrick Bennett, Emily Heath +1

Given a $k$ -uniform hypergraph $G$ and a set of $k$ -uniform hypergraphs $H$ , the generalized Ramsey number $f (G, H, q)$ is the minimum number of colors needed to…

Edge-coloring Kn,n​ with no 2-colored C2k​

Generalized Ramsey numbers of cycles, paths, and hypergraphs

Edge-coloring $K_{n, n}$ with no 2-colored $C_{2 k}$