The Minimum Asymptotic Density of Binary Caterpillars
| Auteur | DOSSOU OLORY, AUDACE AMEN VIOUTOU | |
| Date d'ajout | 2026-06-02T16:06:57Z | |
| Date de disponibilite | 2026-06-02T16:06:57Z | |
| Date de publication | 2019 | |
| Resume | Given d ≥ 2 and two rooted d-ary trees D and T such that D has k leaves, the density γ (D, T ) of D in T is the proportion of all k-element subsets of leaves of T that induce a tree isomorphic to D, after contracting all vertices of outdegree 1. In a recent work, it was proved that the limit inferior of this density as the size of T grows to infinity is always zero unless D is the k-leaf binary caterpillar Fk2 (the binary tree with the property that a path remains upon removal of all the k leaves). Our main theorem in this paper is an exact formula (involving both d and k) for the limit inferior of γ (Fk2 , T ) as the size of T tends to infinity. | |
| DOI | 10.1007/s00373-018-1984-7 | |
| Autre identifiant | BECDB-13728 | |
| URI | https://dspace.uac.bj/handle/123456789/11739 | |
| Langue | fr | |
| Fait partie de | Graphs and Combinatorics | |
| Sujet | Caterpillars · Minimum asymptotic density · Leaf-induced subtrees · | |
| Sujet | d-ary trees · Inducibility · Complete d-ary trees · Strict d-ary tree | |
| Titre | The Minimum Asymptotic Density of Binary Caterpillars | |
| Type | Article |