activity
20072023
most citedThe triangle-free process and the Ramsey number

33 citations · 131 across the 23 of their papers we have counts for

collaborators
Showing math.COShow all

17 papers · 1 filter

math.CO2023

Moderate deviations of triangle counts in sparse Erdős-Rényi random graphs and

José D. Alvarado, Leonardo Gonçalves de Oliveira, Simon Griffiths

We consider the question of determining the probability of triangle count deviations in the Erdős-Rényi random graphs and with densities larger than $n^{-1/2}(\lo…

math.CO2023

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…

math.CO2020

Deviation probabilities for arithmetic progressions and irregular discrete structures

Simon Griffiths, Christoph Koch, Matheus Secco

Let the random variable count the number of edges of a hypergraph induced by a random -element subset of its vertex set. Focussing…

math.CO2019★ 1 cited

Deviation probabilities for arithmetic progressions and other regular discrete structures

Gonzalo Fiz Pontiveros, Simon Griffiths, Matheus Secco +1

Let the random variable count the number of edges of a hypergraph induced by a random element subset of its vertex set. Focussing…

math.CO2019★ 1 cited

Moderate deviations of subgraph counts in the Erdős-Rényi random graphs and

Christina Goldschmidt, Simon Griffiths, Alex Scott

The main contribution of this article is an asymptotic expression for the rate associated with moderate deviations of subgraph counts in the Erdős-Rényi random graph . Our…

math.CO2015

Chromatic thresholds in sparse random graphs

Peter Allen, Julia Böttcher, Simon Griffiths +2

The chromatic threshold of a graph with respect to the random graph is the infimum over such that the following holds with high probability: the fam…