Simon Griffiths

collaborators

2 papers

math.CO2026

Upper bounds for multicolour Ramsey numbers

Paul Balister, BÃ©la BollobÃ¡s, Marcelo Campos +5

The $r$ -colour Ramsey number $R_{r} (k)$ is the minimum $n \in N$ such that every $r$ -colouring of the edges of the complete graph $K_{n}$ on $n$ vertices contains a monochroma…

math.CO2025

Clique packings in random graphs

Simon Griffiths, LetÃcia Mattos

We consider the question of how many edge-disjoint near-maximal cliques may be found in the dense ErdÅs-RÃ©nyi random graph $G (n, p)$ . Recently Acan and Kahn showed that the larges…