1 citations · 2 across the 6 of their papers we have counts for
19 papers
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…
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…
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.