Michael Missethan

activity

20202024

most citedLongest and shortest cycles in random planar graphs

3 citations · 4 across the 9 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

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★ 3 cited

Longest and shortest cycles in 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 study the cycle and block structure…

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…