16 citations · 33 across the 22 of their papers we have counts for
Showing math.NTShow all
2 papers · 1 filter
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.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…