47 citations · 178 across the 44 of their papers we have counts for
5 papers · 1 filter
Counting Hamilton cycles in Dirac hypergraphs
Stefan Glock, Stephen Gould, Felix Joos +2
A tight Hamilton cycle in a -uniform hypergraph (-graph) is a cyclic ordering of the vertices of such that every set of consecutive vertices in the ordering forms…
On a rainbow version of Dirac's theorem
Felix Joos, Jaehoon Kim
For a collection of not necessarily distinct graphs on the same vertex set , a graph with vertices in is a -transversal if th…
Even -cycles have the edge-Erdős-Pósa property
Henning Bruhn
I prove that even -cycles have the edge-Erdős-Pósa property.
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Stefan Ehard, Stefan Glock, Felix Joos
A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. We prove a rainbow version of the blow-up lemma of Komlós, Sárközy and Szemerédi tha…
Pseudorandom hypergraph matchings
Stefan Ehard, Stefan Glock, Felix Joos
A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect ma…