Metraipolis › archive › dc_53b4e65d438c
Prescribed-order subdigraphs with large minimum out-degree — arXiv:2608.09728
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.09728
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:09:05.909Z
- SHA-256 of the archived text
edc612d2ab0b221ed762977744dd0f3945bc87c00d74a35fd886ba0dd0603fc6- Stable URL of this page
https://metraipolis.com/documento/dc_53b4e65d438c
How to cite
Prescribed-order subdigraphs with large minimum out-degree — arXiv:2608.09728 — arXiv (en), https://arxiv.org/abs/2608.09728 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_53b4e65d438c (Metraipolis archive dc_53b4e65d438c, sha256 edc612d2ab0b221ed762977744dd0f3945bc87c00d74a35fd886ba0dd0603fc6)
BibTeX
@misc{dc53b4e65d438c,
title = {Prescribed-order subdigraphs with large minimum out-degree — arXiv:2608.09728},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.09728},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_53b4e65d438c; sha256 edc612d2ab0b221ed762977744dd0f3945bc87c00d74a35fd886ba0dd0603fc6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09728. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Alon introduced $d(s)$ as the largest integer $d$ such that every digraph on $2n$ vertices with minimum out-degree at least $s$ contains a subdigraph on $n$ vertices with minimum out-degree at least $d$. He proved that $s/2-d(s)=O(\sqrt{s\log s})$, and further asked whether this deficit can be bounded by an absolute constant. Steiner answered this question in the negative by constructing suitable tournaments, and showed that $s/2-d(s)=\Omega(\log s)$. Using a different construction, we show that the deficit grows at least on the square-root scale, rather than merely logarithmically, improving the best known lower bound due to Steiner from $\Omega(\log s)$ to $\Omega(\sqrt{s})$ and leaving only a factor of $\sqrt{\log s}$ between the lower and upper bounds. This also completely settles a question raised by Steiner for tournament hosts. More generally, in the broader setting considered by Alon, our construction applies whenever the prescribed subdigraphs contain any fixed positive proportion of the vertices of the host digraph rather than specifically one half.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.09728 — 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-19T09:05:33.592Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).