Annika Heckel

activity

20122019

collaborators

3 papers

math.CO2019

Non-concentration of the chromatic number of a random graph

Annika Heckel

We show that the chromatic number of $G_{n, \frac{1}{2}}$ is not concentrated on fewer than $n^{\frac{1}{4} - ε}$ consecutive values. This addresses a longstanding question rai…

math.CO2018

Random triangles in random graphs

Annika Heckel

In a recent paper, Oliver Riordan shows that for $r \geq 4$ and $p$ up to and slightly larger than the threshold for a $K_{r}$ -factor, the hypergraph formed by the copies of $K_{r}$ in…

math.CO2012

The hitting time of rainbow connection number two

Annika Heckel, Oliver Riordan

In a graph $G$ with a given edge colouring, a rainbow path is a path all of whose edges have distinct colours. The minimum number of colours required to colour the edges of $G$ so…