Metraipolis › archive › dc_0eb169ae50f6

Sharp vertex connectivity of the Markoff graphs modulo $p$ — arXiv:2608.07880

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.07880
License (as archived)
CC0-1.0
Archived
2026-10-19T09:09:09.748Z
SHA-256 of the archived text
9a73456c17eb5aedd6d6eae8186519f01423684706b3ff0b43641c8acc61cf1d
Stable URL of this page
https://metraipolis.com/documento/dc_0eb169ae50f6

How to cite

Sharp vertex connectivity of the Markoff graphs modulo $p$ — arXiv:2608.07880 — arXiv (en), https://arxiv.org/abs/2608.07880 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0eb169ae50f6 (Metraipolis archive dc_0eb169ae50f6, sha256 9a73456c17eb5aedd6d6eae8186519f01423684706b3ff0b43641c8acc61cf1d)
BibTeX
@misc{dc0eb169ae50f6,
  title = {Sharp vertex connectivity of the Markoff graphs modulo $p$ — arXiv:2608.07880},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.07880},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0eb169ae50f6; sha256 9a73456c17eb5aedd6d6eae8186519f01423684706b3ff0b43641c8acc61cf1d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.07880. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For a prime $p$ and $k\in\mathbb{F}_p$, the generalized Markoff graph $G_{p,k}$ is an undirected graph whose vertices are the solutions over the finite field $\mathbb{F}_p$ of the normalized Markoff equation \[ x_1^2+x_2^2+x_3^2=x_1x_2x_3+k, \] where two vertices are adjacent if they differ by a Vieta involution. The Markoff graph $G_p$ is obtained from $G_{p,0}$ by removing the origin. The structure of $G_p$ has been the subject of extensive study; in particular, a major breakthrough of Bourgain, Gamburd, and Sarnak established that $G_p$ contains a giant connected component. Combined with Chen's remarkable divisibility theorem, this implies that $G_p$ is connected for all sufficiently large primes $p$. In the same paper, Bourgain, Gamburd, and Sarnak further asked whether the family $\{G_p\colon \text{primes }p\geq 5\}$ forms an expander family. This motivates us to investigate the robustness of connectivity in the Markoff graphs. The main result of this paper is proved in the general setting: for every prime $p\geq5$ and every $k\in\mathbb{F}_p\setminus\{4\}$, each connected component $C$ of $G_{p,k}$ with $|V(C)|\geq 3$ is $2$-connected. Reducing to the case $k=0$, we conclude that if the Markoff graph $G_p$ is connected, then it is in fact $2$-connected. Consequently, the Markoff graph $G_p$ is $2$-connected for all sufficiently large primes $p$. This is sharp in the sense that $G_p$ is not $3$-connected for any prime $p\geq 7$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.CO).
Categorie arXiv: Number Theory (math.NT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.07880 — 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-19T09:05:33.600Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).