Metraipolis › archive › dc_faf84d22d25a
Exact Counts of Binary Phylogenetic Networks with Four Reticulations — arXiv:2609.21772
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21772
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:12:46.240Z
- SHA-256 of the archived text
369466939827dabf2c3ad58a4af86f611d51f196e40f0de713e6f6619f2c9355- Stable URL of this page
https://metraipolis.com/documento/dc_faf84d22d25a
How to cite
Exact Counts of Binary Phylogenetic Networks with Four Reticulations — arXiv:2609.21772 — arXiv (en), https://arxiv.org/abs/2609.21772 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_faf84d22d25a (Metraipolis archive dc_faf84d22d25a, sha256 369466939827dabf2c3ad58a4af86f611d51f196e40f0de713e6f6619f2c9355)
BibTeX
@misc{dcfaf84d22d25a,
title = {Exact Counts of Binary Phylogenetic Networks with Four Reticulations — arXiv:2609.21772},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21772},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_faf84d22d25a; sha256 369466939827dabf2c3ad58a4af86f611d51f196e40f0de713e6f6619f2c9355},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21772. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Phylogenetic networks provide a flexible framework for representing reticulate evolutionary processes, such as hybridization, introgression, recombination, and horizontal gene transfer. However, their combinatorial complexity makes even basic enumeration problems difficult. Building on our previous work for networks with up to three reticulations, we derive an explicit closed-form formula for the number of unrestricted rooted binary phylogenetic networks with four reticulations on \(n\) labeled taxa. Our approach is based on tree-component graphs. We classify the 79 possible component graphs corresponding to networks with four reticulations into ten groups. We then enumerate the networks associated with each group by combining known counts of one-component networks, forests, and networks with fewer reticulations. Summing these contributions yields the desired formula. This result extends the exact enumeration of unrestricted binary phylogenetic networks to four reticulations and further demonstrates the effectiveness of component graphs for systematically organizing and counting increasingly complex network classes. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.CO). Categorie arXiv: Populations and Evolution (q-bio.PE) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.21772 — 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-10T01:48:20.622Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).