Felix Joos

collaborators

5 papers

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…

cs.DS2024

Engineering Hypergraph $b$ -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 $b$ -matchings in hypergraphs broadening the scope of potential applications and…

math.CO2024

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…

Connecting vertex sets to walls

Counting tight Hamilton cycles in Dirac hypergraphs

The hypergraph removal process

Engineering Hypergraph b-Matching Algorithms

Conflict-free Hypergraph Matchings and Coverings

Engineering Hypergraph $b$ -Matching Algorithms