Deepak Bal

activity

20112022

most citedOn Sharp Thresholds of Monotone Properties: Bourgain's Proof Revisited

2 citations · 3 across the 5 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018★ 1 cited

Zero Forcing Number of Random Regular Graphs

Deepak Bal, Patrick Bennett, Sean English +2

The zero forcing process is an iterative graph colouring process in which at each time step a coloured vertex with a single uncoloured neighbour can force this neighbour to become…

math.CO2018

The bipartite $K_{2, 2}$ -free process and bipartite Ramsey number $b (2, t)$

Deepak Bal, Patrick Bennett

The bipartite Ramsey number $b (s, t)$ is the smallest integer $n$ such that every blue-red edge coloring of $K_{n, n}$ contains either a blue $K_{s, s}$ or a red $K_{t, t}$ . In the bip…

Zero Forcing Number of Random Regular Graphs

The bipartite K2,2​-free process and bipartite Ramsey number b(2,t)

The bipartite $K_{2, 2}$ -free process and bipartite Ramsey number $b (2, t)$