Deepak Bal

collaborators

3 papers

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…

q-bio.PE2024

Exploring the Dynamics of Lotka-Volterra Systems: Efficiency, Extinction Order, and Predictive Machine Learning

Sepideh Vafaie, Deepak Bal, Michael A. S. Thorne +1

For years, a main focus of ecological research has been to better understand the complex dynamical interactions between species which comprise food webs. Using the connectance prop…

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​

Exploring the Dynamics of Lotka-Volterra Systems: Efficiency, Extinction Order, and Predictive Machine Learning

Generalized Ramsey numbers of cycles, paths, and hypergraphs

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