35 citations · 185 across the 58 of their papers we have counts for
5 papers · 1 filter
A simple proof of almost percolation on G(n;p)
Mihyun Kang, Tamás Makai
We consider bootstrap percolation on the binomial random graph with infection threshold , an infection process which starts from a set of initially infect…
Bootstrap percolation on G(n,p) revisited
Mihyun Kang, Tamás Makai
Bootstrap percolation on a graph with infection threshold is an infection process, which starts from a set of initially infected vertices and in each step every v…
Cubic graphs and related triangulations on orientable surfaces
Wenjie Fang, Mihyun Kang, Michael Moßhammer +1
Let be the orientable surface of genus . We show that the number of vertex-labelled cubic multigraphs embeddable on with vertices is asymptoti…
Homological connectivity of random hypergraphs
Oliver Cooley, Penny Haxell, Mihyun Kang +1
We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homol…
Jigsaw percolation on random hypergraphs
Béla Bollobás, Oliver Cooley, Mihyun Kang +1
The jigsaw percolation process on graphs was introduced by Brummitt, Chatterjee, Dey, and Sivakoff as a model of collaborative solutions of puzzles in social networks. Percolation…