35 citations · 185 across the 58 of their papers we have counts for
4 papers · 2 filters
Characterisation of symmetries of unlabelled triangulations and its applications
Mihyun Kang, Philipp Sprüssel
We give a full characterisation of the symmetries of unlabelled triangulations and derive a constructive decomposition of unlabelled triangulations depending on their symmetries. A…
How does the core sit inside the mantle?
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +1
The -core, defined as the largest subgraph of minimum degree , of the random graph has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [JCT…
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…
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…