2 citations · 4 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2024★ 2 cited
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…
math.CO2022
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…