47 citations · 178 across the 44 of their papers we have counts for
9 papers · 1 filter
The edge-Erdős-Pósa property
Henning Bruhn, Matthias Heinlein, Felix Joos
Robertson and Seymour proved that the family of all graphs containing a fixed graph as a minor has the Erdős-Pósa property if and only if is planar. We show that this is no…
-subdivisions have the edge-Erdős-Pósa property
Henning Bruhn, Matthias Heinlein
We prove that every graph contains either edge-disjoint -subdivisions or a set of at most edges such that does not contain any -subdivis…
Euler tours in hypergraphs
Stefan Glock, Felix Joos, Daniela Kühn +1
We show that a quasirandom -uniform hypergraph has a tight Euler tour subject to the necessary condition that divides all vertex degrees. The case when is complete c…
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 into edge-disjoint copies of a given -factor. We show that this can be achieved for all…
Erdős-Pósa property for labelled minors: 2-connected minors
Henning Bruhn, Felix Joos, Oliver Schaudt
In the 1960s, Erdős and Pósa proved that there is a packing-covering duality for cycles in graphs. As part of the graph minor project, Robertson and Seymour greatly extended this:…
Spanning trees in randomly perturbed graphs
Felix Joos, Jaehoon Kim
A classical result of Komlós, Sárközy and Szemerédi states that every -vertex graph with minimum degree at least contains every -vertex tree with maximum degre…
Edge correlations in random regular hypergraphs and applications to subgraph testing
Alberto Espuny Díaz, Felix Joos, Daniela Kühn +1
Compared to the classical binomial random (hyper)graph model, the study of random regular hypergraphs is made more challenging due to correlations between the occurrence of differe…
On kissing numbers and spherical codes in high dimensions
Matthew Jenssen, Felix Joos, Will Perkins
We prove a lower bound of on the kissing number in dimension . This improves the classical lower bound of Chabauty, Shannon, and Wyner by a lin…
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 -bounded edge colourings. This enables the systematic study of rainbow embeddings of bounde…