Michael Missethan

activity

20202024

most citedThe emergence of a giant rainbow component

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

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2022★ 1 cited

The emergence of a giant rainbow component

Oliver Cooley, Tuan Anh Do, Joshua Erde +1

The random coloured graph $G_{c} (n, p)$ is obtained from the Erdős-Rényi binomial random graph $G (n, p)$ by assigning to each edge a colour from a set of $c$ colours independently and…

math.CO2021

Local limit of sparse random planar graphs

Mihyun Kang, Michael Missethan

Let $P (n, m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set ${1, \dots, n}$ with $m = m (n)$ edges. We determine the (Benjamini-…

math.CO2020

Two point concentration of maximum degree in sparse random planar graphs

Mihyun Kang, Michael Missethan

Let $P (n, m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set ${1, \dots, n}$ with $m = m (n)$ edges. We show that in the sparse r…

math.CO2020

The giant component and 2-core in sparse random outerplanar graphs

Mihyun Kang, Michael Missethan

Let $A (n, m)$ be a graph chosen uniformly at random from the class of all vertex-labelled outerplanar graphs with $n$ vertices and $m$ edges. We consider $A (n, m)$ in the sparse regi…