Felix Joos

most citedConflict-free Hypergraph Matchings and Coverings

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

Fractional clique decompositions in random hypergraphs

Felix Joos, Zak Smith

We prove that, whenever $p \geq n^{- 1/2 + o (1)}$ , with high probability $G (n, p)$ admits a fractional triangle decomposition, that is, a non-negative weight function on its tria…

math.CO2026

Connecting vertex sets to walls

Henning Bruhn, Felix Joos, Arthur Ulmer

Menger's theorem on $A$ -- $B$ -paths and Gallai's theorem on $A$ -paths are among the most useful results in structural graph theory. Many variants and extensions are known. We add to…

math.CO2026

Counting tight Hamilton cycles in Dirac hypergraphs

Felix Joos, Xinyue Xie

Suppose $G$ is a $k$ -uniform hypergraph on $n$ vertices such that every $(k - 1)$ -subset $S$ of $V (G)$ belongs to at least $δ n$ edges, where $δ > 1/2$ . Let $Ψ (G)$ denote the number of…

math.CO2024

The hypergraph removal process

Felix Joos, Marcus Kühn

Let $k \geq 2$ and fix a $k$ -uniform hypergraph $F$ . Consider the random process that, starting from a $k$ -uniform hypergraph $H$ on $n$ vertices, repeatedly del…

math.CO2024★ 1 cited

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…