Metraipolis › archive › dc_6623cfa438db

The Connectivity Threshold for Friends and Strangers graphs — arXiv:2611.05254

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05254
License (as archived)
CC0-1.0
Archived
2026-11-04T19:00:25.167Z
SHA-256 of the archived text
27c31957ef548f5558b86acdf1c19dc8dd1bbc94cc7b5b43add2ce315cc1c64d
Stable URL of this page
https://metraipolis.com/documento/dc_6623cfa438db

How to cite

The Connectivity Threshold for Friends and Strangers graphs — arXiv:2611.05254 — arXiv (en), https://arxiv.org/abs/2611.05254 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6623cfa438db (Metraipolis archive dc_6623cfa438db, sha256 27c31957ef548f5558b86acdf1c19dc8dd1bbc94cc7b5b43add2ce315cc1c64d)
BibTeX
@misc{dc6623cfa438db,
  title = {The Connectivity Threshold for Friends and Strangers graphs — arXiv:2611.05254},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05254},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6623cfa438db; sha256 27c31957ef548f5558b86acdf1c19dc8dd1bbc94cc7b5b43add2ce315cc1c64d},
  year = {2026}
}

Archived text

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

The concept of the Friends and Strangers graph $FS(G,H)$ associated with two graphs $G$ and $H$ was recently introduced by Defant and Kravitz and has generated significant interest. In a companion article, joint with Alon, they consider the behaviour of $FS(G,H)$ in the case where $G$ and $H$ are Erdős-Rényi random graphs, and prove that the threshold for connectivity is of the form $n^{-1/2+o(1)}$. In this paper we prove that the threshold is $n^{-1/2}\sqrt{\log{n}}$, up to a multiplicative constant, answering a question from Alon, Defant and Kravitz.

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/2611.05254 — 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-04T18:38:22.326Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).