English

Inducibility and universality for trees

Combinatorics 2022-07-01 v2

Abstract

We answer three questions posed by Bubeck and Linial on the limit densities of subtrees in trees. We prove there exist positive ε1\varepsilon_1 and ε2\varepsilon_2 such that every tree that is neither a path nor a star has inducibility at most 1ε11-\varepsilon_1, where the inducibility of a tree TT is defined as the maximum limit density of TT, and that there are infinitely many trees with inducibility at least ε2\varepsilon_2. Finally, we construct a universal sequence of trees; that is, a sequence in which the limit density of any tree is positive.

Keywords

Cite

@article{arxiv.2102.02010,
  title  = {Inducibility and universality for trees},
  author = {Timothy F. N. Chan and Daniel Kral and Bojan Mohar and David R. Wood},
  journal= {arXiv preprint arXiv:2102.02010},
  year   = {2022}
}

Comments

31 pages, 8 figures

R2 v1 2026-06-23T22:47:51.184Z