A. Raigorodskii

activity

20142026

most citedOn the stability of the Erdős-Ko-Rado theorem

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2026

Probability threshold for the stability of $α (G (n, r, s))$

M. M. Koshelev, A. M. Raigorodskii

Let $G (n, r, s)$ be a graph $(V, E)$ such that $V = (r [ n ])$ and $E = {(u, v) ∣∣ u \cap v ∣ = s} .$ In this paper we study the probability threshold for the exact stability of t…

math.CO2025

Spectral gap of $G (n, α n, α^{2} n)$ graphs and the giant component theorem

M. Koshelev, A. Raigorodskii

The spectrum of a graph $G$ is the set of the eigenvalues of its adjacency matrix. It turns out that one can say a lot about a graph with the only knowledge being the spectrum of t…

math.CO2014★ 1 cited

On the stability of the Erdős-Ko-Rado theorem

Béla Bollobás, Bhargav Narayanan, Andrei Raigorodskii

Delete the edges of a Kneser graph independently of each other with some probability: for what probabilities is the independence number of this random graph equal to the independen…

Probability threshold for the stability of α(G(n,r,s))

Spectral gap of G(n,αn,α2n) graphs and the giant component theorem

On the stability of the Erdős-Ko-Rado theorem

Probability threshold for the stability of $α (G (n, r, s))$

Spectral gap of $G (n, α n, α^{2} n)$ graphs and the giant component theorem