35 citations · 185 across the 58 of their papers we have counts for
Showing 2007Show all
3 papers · 1 filter
math.CO2007★ 3 cited
How Much Work Does It Take To Straighten a Plane Graph Out?
Mihyun Kang, Mathias Schacht, Oleg Verbitsky
We prove that if one wants to make a plane graph drawing straight-line then in the worst case one has to move almost all vertices.
math.CO2007★ 26 cited
The Order of the Giant Component of Random Hypergraphs
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
We establish central and local limit theorems for the number of vertices in the largest component of a random -uniform hypergraph $\hnp$ with edge probability $p=c/\binnd$, wher…
math.CO2007★ 9 cited
Local Limit Theorems and Number of Connected Hypergraphs
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
Let signify a random -uniform hypergraph with vertices in which each of the possible edges is present with probability independently, and…