Stefan Glock

activity

20182026

most citedNote on induced paths in sparse random graphs

1 citations · 1 across the 8 of their papers we have counts for

collaborators

Showing 2018Show all

6 papers · 1 filter

math.CO2018

Triple systems with no three triples spanning at most five points

Stefan Glock

We show that the maximum number of triples on $n$ ~points, if no three triples span at most five points, is $(1 \pm o (1)) n^{2} /5$ . More generally, let $f^{(r)} (n; k, s)$ be the maximum n…

math.CO2018

Euler tours in hypergraphs

Stefan Glock, Felix Joos, Daniela Kühn +1

We show that a quasirandom $k$ -uniform hypergraph $G$ has a tight Euler tour subject to the necessary condition that $k$ divides all vertex degrees. The case when $G$ is complete c…

math.CO2018

Minimalist designs

Ben Barber, Stefan Glock, Daniela Kühn +3

The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for c…

math.CO2018

Resolution of the Oberwolfach problem

Stefan Glock, Felix Joos, Jaehoon Kim +2

The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of $K_{2 n + 1}$ into edge-disjoint copies of a given $2$ -factor. We show that this can be achieved for all…

math.CO2018

A rainbow blow-up lemma

Stefan Glock, Felix Joos

We prove a rainbow version of the blow-up lemma of Komlós, Sárközy and Szemerédi for $μ n$ -bounded edge colourings. This enables the systematic study of rainbow embeddings of bounde…

math.CO2018

On a conjecture of Erdős on locally sparse Steiner triple systems

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

A famous theorem of Kirkman says that there exists a Steiner triple system of order $n$ if and only if $n \equiv 1, 3 mod 6$ . In 1973, Erdős conjectured that one can find so-called…