activity
20122026
most citedUpper bounds for multicolour Ramsey numbers

2 citations · 2 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO2026

On the multicolour Ramsey numbers

Bruno Andrades, Marcelo Campos, Robert Morris

In this paper we determine the Ramsey number up to a constant factor, showing that The proof of the lower bound com…

math.CO2026

On the Erdős-Rogers function

Robert Morris, Julian Sahasrabudhe, Jacques Verstraëte

We show that the Erdős-Rogers function satisfies for every . More precisely, we construct a -free graph on…

math.CO2026

Some recent results in Ramsey theory

Robert Morris

The purpose of this survey is to provide a gentle introduction to several recent breakthroughs in graph Ramsey theory. In particular, we will outline the proofs (due to various gro…

math.CO2025

Random cliques in random graphs revisited

Robert Morris, Oliver Riordan

We study the distribution of the set of copies of some given graph in the random graph , focusing on the case when . Our main results capture the 'leading term…

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.CO2012

Independent sets in hypergraphs

József Balogh, Robert Morris, Wojciech Samotij

Many important theorems in combinatorics, such as Szemerédi's theorem on arithmetic progressions and the Erdős-Stone Theorem in extremal graph theory, can be phrased as statements…