Metraipolis › archive › dc_d6d19ff4c8db
When are random regular triangle-free graphs bipartite? — arXiv:2609.17958
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.17958
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T16:13:01.556Z
- SHA-256 of the archived text
d13eca7c30e05f7538e906c18970175a5ecdb6e72a8ca883d75480f1bd2a9ccf- Stable URL of this page
https://metraipolis.com/documento/dc_d6d19ff4c8db
How to cite
When are random regular triangle-free graphs bipartite? — arXiv:2609.17958 — arXiv (en), https://arxiv.org/abs/2609.17958 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d6d19ff4c8db (Metraipolis archive dc_d6d19ff4c8db, sha256 d13eca7c30e05f7538e906c18970175a5ecdb6e72a8ca883d75480f1bd2a9ccf)
BibTeX
@misc{dcd6d19ff4c8db,
title = {When are random regular triangle-free graphs bipartite? — arXiv:2609.17958},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.17958},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d6d19ff4c8db; sha256 d13eca7c30e05f7538e906c18970175a5ecdb6e72a8ca883d75480f1bd2a9ccf},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.17958. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the structure of random $d$-regular triangle-free graphs and show that a sharp phase transition occurs at $d=\frac{\sqrt 3}{2}\sqrt{n \log n}$. For smaller $d$, asymptotically almost surely the graph is non-bipartite, whereas for greater $d$, asymptotically almost surely the graph is bipartite.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.17958 — 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-15T15:38:58.221Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).