105 citations · 304 across the 45 of their papers we have counts for
39 papers · 1 filter
An exponential improvement for diagonal Ramsey
Marcelo Campos, Simon Griffiths, Robert Morris +1
The Ramsey number is the minimum such that every red-blue colouring of the edges of the complete graph on vertices contains a monochromatic copy…
A lower bound for set-colouring Ramsey numbers
Lucas Aragão, Maurício Collares, João Pedro Marciano +2
The set-colouring Ramsey number is defined to be the minimum such that if each edge of the complete graph is assigned a set of colours from $\{1,\ldots,r…
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 Typical Structure of Sets with Small Sumset
Marcelo Campos, Maurício Collares, Robert Morris +2
In this paper we determine the number and typical structure of sets of integers with bounded doubling. In particular, improving recent results of Green and Morris, and of Mazur, we…
On the singularity of random symmetric matrices
Marcelo Campos, Letícia Mattos, Robert Morris +1
A well-known conjecture states that a random symmetric matrix with entries in is singular with probability . In this paper we prove…
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…