Metraipolis › archive › dc_5d84bee68879
Homomorphic-core phase transition threshold in Erdős--Rényi random graphs — arXiv:2608.24520
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.24520
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T07:03:52.542Z
- SHA-256 of the archived text
2984d29261680a57f3a428b699bd208b80d025efd64042f06a991b7528f07b7e- Stable URL of this page
https://metraipolis.com/documento/dc_5d84bee68879
How to cite
Homomorphic-core phase transition threshold in Erdős--Rényi random graphs — arXiv:2608.24520 — arXiv (en), https://arxiv.org/abs/2608.24520 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5d84bee68879 (Metraipolis archive dc_5d84bee68879, sha256 2984d29261680a57f3a428b699bd208b80d025efd64042f06a991b7528f07b7e)
BibTeX
@misc{dc5d84bee68879,
title = {Homomorphic-core phase transition threshold in Erdős--Rényi random graphs — arXiv:2608.24520},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.24520},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5d84bee68879; sha256 2984d29261680a57f3a428b699bd208b80d025efd64042f06a991b7528f07b7e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24520. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
It is shown in this manuscript that a random graph $G$ drawn from the Erdős--Rényi model $\mathcal{G}(n,p)$ with \[ p=p(n)\leq 1/2, \qquad \lim_{n\to+\infty}(np-\log n-\log\log n)=+\infty, \] is a homomorphic core, i.e., every homomorphism from $G$ to itself is an automorphism. This implies tight ETH-based lower bounds of the subgraph isomorphism problem for almost all $k$-vertex patterns with polynomial average degree.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-26 in cs.DS).
Categorie arXiv: Combinatorics (math.CO) ; Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2608.24520 — 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-18T07:01:33.506Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).