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 and such that every tree that is neither a path nor a star has inducibility at most , where the inducibility of a tree is defined as the maximum limit density of , and that there are infinitely many trees with inducibility at least . 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