4 citations · 7 across the 13 of their papers we have counts for
Showing 2013 · math.COShow all
3 papers · 2 filters
math.CO2013
Lazy Cops and Robbers played on Graphs
Deepak Bal, Anthony Bonato, William B. Kinnersley +1
We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for…
math.CO2013
Rainbow Matchings and Hamilton Cycles in Random Graphs
Deepak Bal, Alan Frieze
Let be drawn uniformly from all -uniform, -partite hypergraphs where each part of the partition is a disjoint copy of . We let $HP^{(\k)}_{n,m,k}$ be an edg…
math.CO2013
Packing tree factors in random and pseudo-random graphs
Deepak Bal, Alan Frieze, Michael Krivelevich +1
For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is a collection of vertex disjoint (not necessarily induced) copies of H in G cove…