Christoph Koch

activity

20152020

most citedThreshold and hitting time for high-order connectivity in random hypergraphs

4 citations · 4 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2020

Deviation probabilities for arithmetic progressions and irregular discrete structures

Simon Griffiths, Christoph Koch, Matheus Secco

Let the random variable $X := e (H [B])$ count the number of edges of a hypergraph $H$ induced by a random $m$ -element subset $B$ of its vertex set. Focussing…

math.CO2018

The size of the giant component in random hypergraphs: a short proof

Oliver Cooley, Mihyun Kang, Christoph Koch

We consider connected components in $k$ -uniform hypergraphs for the following notion of connectedness: given integers $k \geq 2$ and $1 \leq j \leq k - 1$ , two $j$ -sets (of vertices) lie…

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 $k$ -uniform hypergraphs: Two $j$ -sets are $j$ -connected if there is a walk of edges between them such that two consecutive e…