A. Shapiro

collaborators

3 papers

math.CO2026

Range of Clique Counts in Graphs

Mihir Neve, Alexey Pokrovskiy, Andrey Shapiro

Let $γ (G)$ denote the number of cliques in a graph $G$ and let $Γ (n) := {γ (G) : ∣ V (G) ∣ = n}$ be the set of values of $γ (G)$ that can be attained on $n$ vertices. We improve on a resul…

math.CO2026

A Note on the Asymptotic Least Density of Covering Codes in $[q]^{n}$

Andrey Shapiro

In this short note we revisit the upper bound of the asymptotic least density of covering codes of radius $R$ in $[q]^{n}$ established by Krivelevich, Sudakov, and Vu. We show that b…

math.CO2026

A linear upper bound on zero-sum Ramsey numbers of $d$ -degenerate graphs in $Z_{p}$

Andrey Shapiro

Let $p$ be a prime number and let $G$ be a graph on $n$ vertices and $m$ edges. The zero-sum Ramsey number of $G$ over $Z_{p}$ , denoted by $R (G, Z_{p})$ , is the minim…

Range of Clique Counts in Graphs

A Note on the Asymptotic Least Density of Covering Codes in [q]n

A linear upper bound on zero-sum Ramsey numbers of d-degenerate graphs in Zp​

A Note on the Asymptotic Least Density of Covering Codes in $[q]^{n}$

A linear upper bound on zero-sum Ramsey numbers of $d$ -degenerate graphs in $Z_{p}$