G. Zakharov

activity

20232026

collaborators

5 papers

math.CO2026

Sharp threshold for reconstructing points on the line

Georgii Zakharov

For a set of $n$ points $V \subseteq R$ let $G (V, p)$ be the random graph on $V$ where each possible edge is present independently with probability $p$ . We call a subset $…

math.PR2025

On the threshold for triangulations inside convex polygons

Brett Kolesnik, Georgii Zakharov, Maksim Zhukovskii

Start with a large convex polygon and add all other edges inside independently with probability $p$ . At what critical threshold $p_{c}$ do triangulations of the polygon begin to appe…

math.CO2025

Sums along the edges of bounded degree graphs

Noga Alon, Itai Benjamini, Georgii Zakharov +1

Let $G$ be a graph on $n$ vertices and $(H, +)$ be an abelian group. What is the minimum size $S_{H} (G)$ of the set of all sums $A (u) + A (v)$ over all injections $A : V (G) \to H$ ? In…

math.CO2025

Majority dynamics on finite trees

Itai Benjamini, Georgii Zakharov, Maksim Zhukovskii

For an arbitrary finite tree $T$ , we find the exact value of the wort-case stabilisation time of majority dynamics on $T$ . We also prove that for a perfect rooted cubic tree $T$ wi…

cs.CC2023

Enumerating Complexity Revisited

Alexander Shekhovtsov, Georgii Zakharov

Consider a subset of positive integers $S$ . In this paper, we reduce the upper bound on the length of a minimum program that enumerates $S$ in terms of the probability of $S$ being…