Metraipolis › archive › dc_02ab6348f5ff
Rigidity of expanders and pseudorandom graphs — arXiv:2608.21058
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21058
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T10:46:59.113Z
- SHA-256 of the archived text
aadef3a735c2245d5dc7c33d7ee63260ebf9eabf95f9f362c48efc2d830ebf23- Stable URL of this page
https://metraipolis.com/documento/dc_02ab6348f5ff
How to cite
Rigidity of expanders and pseudorandom graphs — arXiv:2608.21058 — arXiv (en), https://arxiv.org/abs/2608.21058 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_02ab6348f5ff (Metraipolis archive dc_02ab6348f5ff, sha256 aadef3a735c2245d5dc7c33d7ee63260ebf9eabf95f9f362c48efc2d830ebf23)
BibTeX
@misc{dc02ab6348f5ff,
title = {Rigidity of expanders and pseudorandom graphs — arXiv:2608.21058},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21058},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_02ab6348f5ff; sha256 aadef3a735c2245d5dc7c33d7ee63260ebf9eabf95f9f362c48efc2d830ebf23},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21058. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, the only continuous motions of the vertices preserving the distances between all pairs of adjacent vertices are those induced from the isometries of $\mathbb{R}^d$ (that is, translations and rotations of the whole graph). In this paper, we study rigidity properties of pseudorandom graphs. First, we consider $C$-expander graphs, a class of graphs recently studied in the context of Hamiltonicity of pseudorandom graphs. These are $n$-vertex graphs for which every vertex set $A$ of size smaller than $n/(2C)$ has a neighbourhood of size at least $C|A|$, and for every pair of disjoint sets $A,B$ of size at least $n/(2C)$ each, there is at least one edge between $A$ and $B$. We show that for every $C\ge 8$ and every integer $n\ge 9C$, every $n$-vertex $C$-expander is $\lfloor C/8\rfloor$-rigid. Next, we study $(n,r,\lambda)$-graphs, which are $n$-vertex $r$-regular graphs whose non-trivial adjacency eigenvalues are bounded in absolute value by $\lambda$. This is a well-known family of graphs, known to possess various pseudorandom properties. We prove that there exist absolute constants $c_1,c_2>0$ such that every $(n,r,\lambda)$-graph $G$ with $\lambda\le c_1r$ is $\lfloor c_2r\rfloor$-rigid. Our results are sharp up to the value of the universal constants involved, and they improve and extend previous work by the authors on the rigidity of random and pseudorandom graphs.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-24 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.21058 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T10:39:26.744Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).