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…