47 citations · 178 across the 44 of their papers we have counts for
54 papers
On the Prague dimension of sparse random graphs
Felix Joos, Letícia Mattos
The Prague dimension of a graph is defined as the minimum number of complete graphs whose direct product contains as an induced subgraph. Introduced in the 1970s by Nešetři…
Hitting times in the binomial random graph
Bertille Granet, Felix Joos, Jonathan Schrodt
Fix , choose , and consider . For any pair of vertices , we give a simple and prec…
Counting oriented trees in digraphs with large minimum semidegree
Felix Joos, Jonathan Schrodt
Let be an oriented tree on vertices with maximum degree at most . If is a digraph on vertices with minimum semidegree $δ^0(G)\geq(\frac12+o(1)…
Random perfect matchings in regular graphs
Bertille Granet, Felix Joos
We prove that in all regular robust expanders every edge is asymptotically equally likely contained in a uniformly chosen perfect matching . We also show that given any fixe…
On the -problem of Brown, Erdős and Sós
Stefan Glock, Felix Joos, Jaehoon Kim +3
Let be the maximum number of edges of an -uniform hypergraph on vertices not containing a subgraph with edges and at most vertices. In 1973, Brown,…
Ramsey theory constructions from hypergraph matchings
Felix Joos, Dhruv Mubayi
We give asymptotically optimal constructions in generalized Ramsey theory using results about conflict-free hypergraph matchings. For example, we present an edge-coloring of $K_{n,…
Conflict-free hypergraph matchings
Stefan Glock, Felix Joos, Jaehoon Kim +2
A celebrated theorem of Pippenger, and Frankl and Rödl states that every almost-regular, uniform hypergraph with small maximum codegree has an almost-perfect matching…
Sufficient conditions for perfect mixed tilings
Eoin Hurley, Felix Joos, Richard Lang
We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs with components of sublinear order. As…
Decomposing hypergraphs into cycle factors
Felix Joos, Marcus Kühn, Bjarne Schülke
A famous result by Rödl, Ruciński, and Szemerédi guarantees a (tight) Hamilton cycle in -uniform hypergraphs on vertices with minimum -degree $δ_{k-1}(H)\geq (1/2…
Fractional cycle decompositions in hypergraphs
Felix Joos, Marcus Kühn
We prove that for any integer and , there is an integer such that any -uniform hypergraph on vertices with minimum codegree at least…
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
Stefan Ehard, Felix Joos
We prove that any quasirandom uniform hypergraph can be approximately decomposed into any collection of bounded degree hypergraphs with almost as many edges. In fact, our resul…
A short proof of the blow-up lemma for approximate decompositions
Stefan Ehard, Felix Joos
Kim, Kühn, Osthus and Tyomkyn (Trans. Amer. Math. Soc. 371 (2019), 4655--4742) greatly extended the well-known blow-up lemma of Komlós, Sárközy and Szemerédi by proving a `blow-up…
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…
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…