Metraipolis › archive › dc_6ca5ddcaf701
On sparse universally rigid graphs in $\mathbb{R}$ — arXiv:2610.41581
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41581
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T05:44:36.552Z
- SHA-256 of the archived text
fd60c854e0040e22d1078d255f29cf1a329262acde18a24c8d22305a1bb44608- Stable URL of this page
https://metraipolis.com/documento/dc_6ca5ddcaf701
How to cite
On sparse universally rigid graphs in $\mathbb{R}$ — arXiv:2610.41581 — arXiv (en), https://arxiv.org/abs/2610.41581 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6ca5ddcaf701 (Metraipolis archive dc_6ca5ddcaf701, sha256 fd60c854e0040e22d1078d255f29cf1a329262acde18a24c8d22305a1bb44608)
BibTeX
@misc{dc6ca5ddcaf701,
title = {On sparse universally rigid graphs in $mathbbR$ — arXiv:2610.41581},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41581},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6ca5ddcaf701; sha256 fd60c854e0040e22d1078d255f29cf1a329262acde18a24c8d22305a1bb44608},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41581. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A graph is said to be 1-universally rigid if, for any generic realization of its vertices on the real line, the realization cannot be deformed out of the line in any higher-dimensional Euclidean space while preserving all edge lengths. In this paper, we investigate the sparsity of 1-universally rigid graphs in different manners. First, we show that an Erdős-Rényi random graph $G(n,p)$ is 1-universally rigid with high probability whenever $p \geq C\log n \cdot \log\log n/n$ for some sufficiently large constant $C>0$. These techniques also imply the existence of 1-universally rigid graphs of arbitrarily large girth, which resolves a problem suggested by Dantas e Moura, Jordán, and Silverman in a non-constructive manner. We also study how sparse a 1-universally rigid graph can be, proving that there exists an absolute constant $\varepsilon>0$ such that every sufficiently large 1-universally rigid graph on $n$ vertices has at least $(3/2+\varepsilon)n$ edges. This breaks the natural $3/2$ barrier arising from degree-2 extensions and makes progress towards a question of Jordán and Nguyen. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2610.41581 — 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-11-03T05:32:16.999Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).