35 citations · 185 across the 58 of their papers we have counts for
9 papers · 1 filter
Two point concentration of maximum degree in sparse random planar graphs
Mihyun Kang, Michael Missethan
Let be a graph chosen uniformly at random from the class of all planar graphs on vertex set with edges. We show that in the sparse r…
Longest and shortest cycles in random planar graphs
Mihyun Kang, Michael Missethan
Let be a graph chosen uniformly at random from the class of all planar graphs on vertex set with edges. We study the cycle and block structure…
Fragile minor-monotone parameters under random edge perturbation
Dong Yeap Kang, Mihyun Kang, Jaehoon Kim +1
We conduct a quantitative analysis of how many random edges need to be added to a base graph in order to significantly increase natural minor-monotone graph parameters of the r…
Phase transition in cohomology groups of non-uniform random simplicial complexes
Oliver Cooley, Nicola Del Giudice, Mihyun Kang +1
We consider a generalised model of a random simplicial complex, which arises from a random hypergraph. Our model is generated by taking the downward-closure of a non-uniform binomi…
Planarity and genus of sparse random bipartite graphs
Tuan Anh Do, Joshua Erde, Mihyun Kang
The genus of the binomial random graph is well understood for a wide range of . Recently, the study of the genus of the random bipartite graph , with…
The giant component and 2-core in sparse random outerplanar graphs
Mihyun Kang, Michael Missethan
Let be a graph chosen uniformly at random from the class of all vertex-labelled outerplanar graphs with vertices and edges. We consider in the sparse regi…