35 citations · 185 across the 58 of their papers we have counts for
7 papers · 1 filter
Supersaturation Problem for the Bowtie
Mihyun Kang, Tamás Makai, Oleg Pikhurko
The Turán function denotes the maximal number of edges in an -free graph on vertices. We consider the function , the minimal number of copies of in a…
The evolution of random graphs on surfaces
Chris Dowden, Mihyun Kang, Philipp Sprüssel
For integers and , let denote the graph taken uniformly at random from the set of all graphs on with exactly edges and…
Core forging and local limit theorems for the k-core of random graphs
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +1
We establish a multivariate local limit theorem for the order and size as well as several other parameters of the k-core of the Erdos-Renyi graph. The proof is based on a novel app…
Phase transitions in graphs on orientable surfaces
Mihyun Kang, Michael Moßhammer, Philipp Sprüssel
Let be the orientable surface of genus . We prove that the component structure of a graph chosen uniformly at random from the class of all gr…
Bootstrap percolation in random -uniform hypergraphs
Mihyun Kang, Christoph Koch, Tamás Makai
We investigate bootstrap percolation with infection threshold on the binomial -uniform random hypergraph in the regime , when…
Evolution of high-order connected components in random hypergraphs
Oliver Cooley, Mihyun Kang, Christoph Koch
We consider high-order connectivity in -uniform hypergraphs defined as follows: Two -sets are -connected if there is a walk of edges between them such that two consecutive…