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 2021Show all

4 papers · 1 filter

math.CO2021

The early evolution of the random graph process in planar graphs and related classes

Mihyun Kang, Michael Missethan

We study the random planar graph process introduced by Gerke, Schlatter, Steger, and Taraz [The random planar graph process, Random Structures Algorithms 32 (2008), no. 2, 236--261…

math.CO2021

Component behaviour and excess of random bipartite graphs near the critical point

Tuan Anh Do, Joshua Erde, Mihyun Kang +1

The binomial random bipartite graph $G (n, n, p)$ is the random graph formed by taking two partition classes of size $n$ and including each edge between them independently with probab…

math.CO2021

Concentration of maximum degree 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 $[n] := {1, \dots, n}$ with $m = m (n)$ edges. We show that in the spa…

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-…