Metraipolis › archive › dc_bb8f19d5b503
On the Erdős Five-Edge Intersection Problem — arXiv:2608.13071
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.13071
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:50:13.385Z
- SHA-256 of the archived text
b05ae1f01d348c07da6f88a8f50ff0d412df005a8e62fa9f0d4b354380ff1737- Stable URL of this page
https://metraipolis.com/documento/dc_bb8f19d5b503
How to cite
On the Erdős Five-Edge Intersection Problem — arXiv:2608.13071 — arXiv (en), https://arxiv.org/abs/2608.13071 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bb8f19d5b503 (Metraipolis archive dc_bb8f19d5b503, sha256 b05ae1f01d348c07da6f88a8f50ff0d412df005a8e62fa9f0d4b354380ff1737)
BibTeX
@misc{dcbb8f19d5b503,
title = {On the Erdős Five-Edge Intersection Problem — arXiv:2608.13071},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.13071},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bb8f19d5b503; sha256 b05ae1f01d348c07da6f88a8f50ff0d412df005a8e62fa9f0d4b354380ff1737},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13071. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For an $n$-vertex graph $G$ and a permutation $\pi$ of its vertex set, let \[ I_G(\pi)=|E(G)\cap E(G_{\pi})|,\qquad \mu(G)=\min_{\pi} I_G(\pi), \] where $G_{\pi}$ is the copy of $G$ obtained by relabelling every vertex $x\in V(G)$ as $\pi(x)$. Let $f(n,k)$ be the minimum number of edges in an $n$-vertex graph $G$ satisfying $\mu(G)\ge k$. Erdős recorded a construction of Mullin showing $f(n,5)\le 2n-2$ and asked whether equality holds for sufficiently large $n$. We prove that it does: \[ f(n,5)=2n-2 \] for all sufficiently large $n$. The proof strategy is a core--buffer--completion framework: it moves the few high-degree vertices into carefully chosen low-degree positions, confines the allowed overlap to this bounded part, and then relabels the sparse remainder without creating any additional common edge.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.13071 — 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-19T04:28:16.166Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).