Showing 2021Show all
2 papers · 1 filter
math.CO2021
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…
math.CO2021
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…