1 citations · 1 across the 5 of their papers we have counts for
6 papers
Fractional clique decompositions in random hypergraphs
Felix Joos, Zak Smith
We prove that, whenever , with high probability admits a fractional triangle decomposition, that is, a non-negative weight function on its tria…
Connecting vertex sets to walls
Henning Bruhn, Felix Joos, Arthur Ulmer
Menger's theorem on ---paths and Gallai's theorem on -paths are among the most useful results in structural graph theory. Many variants and extensions are known. We add to…
Counting tight Hamilton cycles in Dirac hypergraphs
Felix Joos, Xinyue Xie
Suppose is a -uniform hypergraph on vertices such that every -subset of belongs to at least edges, where . Let denote the number of…
The hypergraph removal process
Felix Joos, Marcus Kühn
Let and fix a -uniform hypergraph . Consider the random process that, starting from a -uniform hypergraph on vertices, repeatedly del…
Engineering Hypergraph -Matching Algorithms
Ernestine Großmann, Felix Joos, Henrik Reinstädtler +1
Recently, researchers have extended the concept of matchings to the more general problem of finding -matchings in hypergraphs broadening the scope of potential applications and…
Conflict-free Hypergraph Matchings and Coverings
Felix Joos, Dhruv Mubayi, Zak Smith
Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree condit…