Metraipolis › archive › dc_da2122b67258
Antidirected forests in digraphs — arXiv:2609.18469
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.18469
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T16:13:07.075Z
- SHA-256 of the archived text
6e9b8d2c5d19a10771d0561d3f74463b90915ca6914c21789d4dc7c9beef81f2- Stable URL of this page
https://metraipolis.com/documento/dc_da2122b67258
How to cite
Antidirected forests in digraphs — arXiv:2609.18469 — arXiv (en), https://arxiv.org/abs/2609.18469 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_da2122b67258 (Metraipolis archive dc_da2122b67258, sha256 6e9b8d2c5d19a10771d0561d3f74463b90915ca6914c21789d4dc7c9beef81f2)
BibTeX
@misc{dcda2122b67258,
title = {Antidirected forests in digraphs — arXiv:2609.18469},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.18469},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_da2122b67258; sha256 6e9b8d2c5d19a10771d0561d3f74463b90915ca6914c21789d4dc7c9beef81f2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18469. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A digraph is antidirected if every vertex has indegree zero or outdegree zero. Let $k\ge2$, and let $F$ be an antidirected forest with $k$ arcs and no isolated vertices. We prove that every digraph $D$ of order $n$ with more than $g_k(n):=2\max\left\{\binom{2k-1}{2}, (k-1)\left(n-\frac{k}{2}\right)\right\}$ arcs contains $F$ as a subdigraph. For $n\ge2k-1$, this threshold equals $2\mathrm{ex}(n,kK_2)$ and is attained by symmetric digraphs arising from extremal $kK_2$-free graphs. Consequently, the maximum directed extremal number over all such forests is $2\mathrm{ex}(n,kK_2)$. The proof combines a counting inequality for rooted antidirected forests, embeddings extending vertex-disjoint arcs, and vertex deletion. In the remaining case, the Gallai--Edmonds decomposition of the underlying graph gives the required bound on the number of arcs.
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.18469 — 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.239Z 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).