Indexed metadata

Aleshin graphs are expanders

Olga Kharlampovich, Alina Vdovina

Source record

Source: arXiv

Published: Oct 22, 2026

arXiv: 2610.30662

Open original source ↗

Source abstract

We prove that the Aleshin level graphs are two-sided expanders. We establish linear diameter bounds for Belaterra and Aleshin graph families. At level nn, the diameters of the Bellaterra and undirected Aleshin graphs are a ∣Vn∣=2n|V_n|=2^n. This improves the quadratic diameter bounds of Malyshev and Pak to the correct order of growth. For the Aleshin graphs we obtain a normalized spectral gap of at least 1−22/31-2\sqrt2/3 and an edge-expansion constant of at least 3−223-2\sqrt2, thereby establishing a Malyshev--Pak's Conjecture with explicit constants. An exact calculation at level ten also proves that the undirected Aleshin graphs are not Ramanujan for any n≥10n\geq10.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Aleshin graphs are expanders — Mathematical Frontier Network