Marc Kaufmann

collaborators

2 papers

math.CO2025

Sharp Thresholds for Factors in Random Graphs

Fabian Burghart, Annika Heckel, Marc Kaufmann +2

Let $F$ be a graph on $r$ vertices and let $G$ be a graph on $n$ vertices. Then an $F$ -factor in $G$ is a subgraph of $G$ composed of $n / r$ vertex-disjoint copies of $F$ , if $r$ di…

math.CO2024

The hitting time of nice factors

Fabian Burghart, Marc Kaufmann, Noela MÃ¼ller +1

Consider the random $u$ -uniform hypergraph (or $u$ -graph) process on $n$ vertices, where $n$ is divisible by $r > u \geq 2$ . It was recently shown that with high probability, as soon a…