Christoph Koch

activity

20142024

most citedBootstrap percolation on geometric inhomogeneous random graphs

19 citations · 44 across the 12 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017★ 2 cited

Finding tight Hamilton cycles in random hypergraphs faster

Peter Allen, Christoph Koch, Olaf Parczyk +1

In an $r$ -uniform hypergraph on $n$ vertices a tight Hamilton cycle consists of $n$ edges such that there exists a cyclic ordering of the vertices where the edges correspond to con…

math.CO2017★ 2 cited

Bootstrap percolation in random $k$ -uniform hypergraphs

Mihyun Kang, Christoph Koch, Tamás Makai

We investigate bootstrap percolation with infection threshold $r > 1$ on the binomial $k$ -uniform random hypergraph $H_{k} (n, p)$ in the regime $n^{- 1} ≪ n^{k - 2} p ≪ n^{- 1/ r}$ , when…

math.CO2017★ 10 cited

Evolution of high-order connected components in random hypergraphs

Oliver Cooley, Mihyun Kang, Christoph Koch

We consider high-order connectivity in $k$ -uniform hypergraphs defined as follows: Two $j$ -sets are $j$ -connected if there is a walk of edges between them such that two consecutive…

Finding tight Hamilton cycles in random hypergraphs faster

Bootstrap percolation in random k-uniform hypergraphs

Evolution of high-order connected components in random hypergraphs

Bootstrap percolation in random $k$ -uniform hypergraphs