activity
20072022
most citedBootstrap percolation in three dimensions

105 citations · 254 across the 20 of their papers we have counts for

collaborators

26 papers

math.PR2022

Subcritical monotone cellular automata

Paul Balister, Béla Bollobás, Robert Morris +1

We study monotone cellular automata (also known as -bootstrap percolation) in with random initial configurations. Confirming a conjecture of Balister, B…

math.CA2019

Flat Littlewood Polynomials Exist

Paul Balister, Béla Bollobás, Robert Morris +2

We show that there exist absolute constants such that, for all , there exists a polynomial of degree , with coefficients, such that $$δ\sqrt…

math.CO2019

The structure and number of Erdős covering systems

Paul Balister, Béla Bollobás, Robert Morris +2

Introduced by Erdős in 1950, a covering system of the integers is a finite collection of arithmetic progressions whose union is the set . Many beautiful questions and c…

math.NT2019★ 4 cited

The Erdős-Selfridge problem with square-free moduli

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 covering systems with distinct moduli was initiated by Erdős in…

math.CO2019

How Ramsey theory can be used to solve Harary's problem for

C. J. Jayawardene, C. C. Rousseau, B. Bollobás

Harary's conjecture for every isolated-free graph G with edges was proved independently by Sidorenko and Goddard and Klietman. In this paper instead of $C_3…

math.NT2018★ 1 cited

On the Erdős Covering Problem: the density of the uncovered set

Paul Balister, Béla Bollobás, Robert Morris +2

Since their introduction by Erdős in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and nume…