19 citations · 44 across the 12 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 4 cited
Threshold and hitting time for high-order connectivity in random hypergraphs
Oliver Cooley, Mihyun Kang, Christoph Koch
We consider the following definition of connectivity in -uniform hypergraphs: Two -sets are -connected if there is a walk of edges between them such that two consecutive e…
math.CO2015★ 6 cited
The size of the giant component in random hypergraphs
Oliver Cooley, Mihyun Kang, Christoph Koch
The phase transition in the size of the giant component in random graphs is one of the most well-studied phenomena in random graph theory. For hypergraphs, there are many possible…