Metraipolis › archive › dc_062ef69ef60b

Are trees really just butterflies in disguise? — arXiv:2609.09142

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.09142
License (as archived): CC0-1.0
Archived: 2026-10-16T14:49:11.694Z
SHA-256 of the archived text: dd42e11b1c447280de7259a6ff851d5c05ede561dd35cdb6cabae83428cb6bc5
Stable URL of this page: https://metraipolis.com/documento/dc_062ef69ef60b

How to cite

Are trees really just butterflies in disguise? — arXiv:2609.09142 — arXiv (en), https://arxiv.org/abs/2609.09142 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_062ef69ef60b (Metraipolis archive dc_062ef69ef60b, sha256 dd42e11b1c447280de7259a6ff851d5c05ede561dd35cdb6cabae83428cb6bc5)

BibTeX

@misc{dc062ef69ef60b,
  title = {Are trees really just butterflies in disguise? — arXiv:2609.09142},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.09142},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_062ef69ef60b; sha256 dd42e11b1c447280de7259a6ff851d5c05ede561dd35cdb6cabae83428cb6bc5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09142. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

As a generalisation of the Erdős-Sós conjecture about graphs, Addario-Berry, Havet, Linhares Sales, Reed and Thomassé conjectured that every digraph on $n$ vertices with more than $(k-1)n$ arcs contains every antidirected tree with $k$ arcs. We prove a dense, approximate version of this for trees with bounded maximum degree, as well as for trees whose layers are evenly distributed. We use a regularity based approach, centred around finding a copy of a given tree in the blow up of a caterpillar.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.09142 — 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-16T14:32:29.900Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).