Annika Heckel

collaborators

3 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.CO2025

The difference between the chromatic and the cochromatic number of a random graph

Annika Heckel

The cochromatic number $I^¶ (G)$ of a graph $G$ is the minimum number of colours needed for a vertex colouring where every colour class is either an independent set or a clique. Let…

math.CO2025

On a question of ErdÅs and Gimbel on the cochromatic number

Annika Heckel

In this note, we show that the difference between the chromatic and the cochromatic number of the random graph $G_{n, 1/2}$ is not whp bounded by $n^{1/2 - o (1)}$ , addressing a questi…

Sharp Thresholds for Factors in Random Graphs

The difference between the chromatic and the cochromatic number of a random graph

On a question of ErdÅs and Gimbel on the cochromatic number

On a question of ErdÅs and Gimbel on the cochromatic number