Metraipolis › archive › dc_b7e7eb018e04
Dense Minors from the Crux — arXiv:2610.39957
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.39957
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:38:01.734Z
- SHA-256 of the archived text
e7ffb99c65acc3dc36b584fa80b6c536962bb0a851b5dee61b9745edce8ea9ad- Stable URL of this page
https://metraipolis.com/documento/dc_b7e7eb018e04
How to cite
Dense Minors from the Crux — arXiv:2610.39957 — arXiv (en), https://arxiv.org/abs/2610.39957 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b7e7eb018e04 (Metraipolis archive dc_b7e7eb018e04, sha256 e7ffb99c65acc3dc36b584fa80b6c536962bb0a851b5dee61b9745edce8ea9ad)
BibTeX
@misc{dcb7e7eb018e04,
title = {Dense Minors from the Crux — arXiv:2610.39957},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.39957},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b7e7eb018e04; sha256 e7ffb99c65acc3dc36b584fa80b6c536962bb0a851b5dee61b9745edce8ea9ad},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39957. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G$ be a graph with average degree $d>0$ and $C_\alpha(G)$ be the minimum order of a subgraph whose average degree is at least $\alpha d$ for any fixed $0<\alpha<1$. Then $G$ has a minor of average degree $\Omega(\sqrt{d\,C_\alpha(G)})$, which is asymptotically tight up to a constant factor. This reveals a unified mechanism underlying previous results on dense minors in locally sparse graphs.
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/2610.39957 — 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-01T02:15:28.285Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).