Inducibility of topological trees

Simple item page
AuteurDOSSOU OLORY, AUDACE AMEN VIOUTOU
AuteurWAGNER, STEPHAN
Date d'ajout2026-06-02T16:06:57Z
Date de disponibilite2026-06-02T16:06:57Z
Date de publication2018
ResumeTrees without vertices of degree 2 are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given number of leaves. The inducibility of a topological tree S is the limit superior of the proportion of all subsets of leaves of T that induce a copy of S as the size of T grows to infinity. In particular, this relaxes the degree-restriction for the existing notion of the inducibility in d-ary trees. We discuss some of the properties of this generalised concept and investigate its connection with the degree-restricted inducibility. In addition, we prove that stars and binary caterpillars are the only topological trees that have an inducibility of 1. We also find an explicit lower bound on the limit inferior of the proportion of all subsets of leaves of T that induce either a star or a binary caterpillar as the size of T tends to infinity.
DOI10.2989/16073606.2018.1497725
Autre identifiantBECDB-13733
URIhttps://dspace.uac.bj/handle/123456789/11744
Languefr
Fait partie deQuaestiones Mathematicae
SujetTopological trees
Sujetinducibility
Sujetmaximum density
Sujetdegree-restricted trees
Sujetleaf
Sujetinduced subtrees
Sujetlimiting minimum density
Sujetd-ary trees
SujetCaterpillars
Sujetstars
TitreInducibility of topological trees
TypeArticle

Files

Collections

Articles