2 citations · 4 across the 4 of their papers we have counts for
5 papers
Upper bounds for multicolour Ramsey numbers
Paul Balister, Béla Bollobás, Marcelo Campos +5
The -colour Ramsey number is the minimum such that every -colouring of the edges of the complete graph on vertices contains a monochroma…
Erdős covering systems
Paul Balister, Béla Bollobás, Robert Morris +2
A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of these objects was initiated by Erdős in 1950, and over the foll…
The critical length for growing a droplet
Paul Balister, Béla Bollobás, Robert Morris +1
In many interacting particle systems, relaxation to equilibrium is thought to occur via the growth of 'droplets', and it is a question of fundamental importance to determine the cr…
Universality for monotone cellular automata
Paul Balister, Béla Bollobás, Robert Morris +1
In this paper we study monotone cellular automata in dimensions. We develop a general method for bounding the growth of the infected set when the initial configuration is chose…
Nucleation and growth in two dimensions
Béla Bollobás, Simon Griffiths, Robert Morris +2
We consider a dynamical process on a graph , in which vertices are infected (randomly) at a rate which depends on the number of their neighbours that are already infected. This…