B. Bollobás

activity

20082023

most citedCops and robbers in random graphs

7 citations · 9 across the 4 of their papers we have counts for

collaborators

4 papers

math.FA2023

Random Translates in Minkowski Sums

Paul Balister, Bela Bollobas, Imre Leader +1

Suppose that $A$ and $B$ are sets in $R^{d}$ , and we form the sumset of $A$ with $n$ random points of $B$ . Given the volumes of $A$ and $B$ , how should we choose them to min…

math.CO2014

A coding problem for pairs of subsets

Bela Bollobas, Zoltan Furedi, Ida Kantor +2

Let $X$ be an $n$ --element finite set, $0 < k \leq n /2$ an integer. Suppose that ${A_{1}, A_{2}}$ and ${B_{1}, B_{2}}$ are pairs of disjoint $k$ -element subsets of $X$ (that is, $|A_1|=|A…

math.OC2009★ 1 cited

Lion and Man -- Can Both Win?

B. Bollobás, I. Leader, M. Walters

This paper is concerned with continuous-time pursuit and evasion games. Typically, we have a lion and a man in a metric space: they have the same speed, and the lion wishes to catc…

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…