7 citations · 9 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2014
A coding problem for pairs of subsets
Bela Bollobas, Zoltan Furedi, Ida Kantor +2
Let be an --element finite set, an integer. Suppose that and are pairs of disjoint -element subsets of (that is, $|A_1|=|A…
math.CO2008★ 7 cited
Cops and robbers in random graphs
Bela Bollobas, Gabor Kun, Imre Leader
We consider the pursuit and evasion game on finite, connected, undirected graphs known as cops and robbers. Meyniel conjectured that for every graph on n vertices a rootish number…