Stefan Glock

activity

20142026

most citedOptimal path and cycle decompositions of dense quasirandom graphs

25 citations · 107 across the 24 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016★ 15 cited

The existence of designs via iterative absorption: hypergraph $F$ -designs for arbitrary $F$

Stefan Glock, Daniela Kühn, Allan Lo +1

We solve the existence problem for $F$ -designs for arbitrary $r$ -uniform hypergraphs~ $F$ . This implies that given any $r$ -uniform hypergraph~ $F$ , the trivially necessary divisibili…

math.CO2016

On the decomposition threshold of a given graph

Stefan Glock, Daniela Kühn, Allan Lo +2

We study the $F$ -decomposition threshold $δ_{F}$ for a given graph $F$ . Here an $F$ -decomposition of a graph $G$ is a collection of edge-disjoint copies of $F$ in $G$ which together…

The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F

On the decomposition threshold of a given graph

The existence of designs via iterative absorption: hypergraph $F$ -designs for arbitrary $F$