Mihyun Kang

activity

20052023

most citedThreshold and hitting time for high-order connectivity in random hypergraphs

4 citations · 18 across the 24 of their papers we have counts for

collaborators

Showing 2005 · math.COShow all

2 papers · 2 filters

math.CO2005

Enumeration and limit laws of series-parallel graphs

Manuel Bodirsky, Omer Gimenez, Mihyun Kang +1

We show that the number $g_{n}$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_{n} \sim g \cdot n^{- 5/2} γ^{n} n!$ , where $γ$ and $g$ are explicit computable cons…

math.CO2005

Enumeration of Unlabeled Outerplanar Graphs

Manuel Bodirsky, Eric Fusy, Mihyun Kang +1

We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number g_n of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,…