105 citations · 254 across the 20 of their papers we have counts for
Showing 2019 · math.COShow all
2 papers · 2 filters
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.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…