Margarita Akhmejanova

collaborators

2 papers

math.CO2025

Weak saturation numbers of large complete bipartite graphs

Margarita Akhmejanova, Ilya Vorobyev, Maksim Zhukovskii

An $n$ -vertex graph $G$ is weakly $F$ -saturated if $G$ contains no copy of $F$ and there exists an ordering of all edges in $E (K_{n}) ∖ E (G)$ such that, when added one at a t…

math.CO2025

On the upper tail of star counts in random graphs

Margarita Akhmejanova, Matas Å ileikis

Let $X$ count the number of $r$ -stars in the random binomial graph $G (n, p)$ . We determine, for fixed $r$ and $ε > 0$ , the asymptotics of $\log \mathbb{P}(X \ge (…