We study the local profiles of trees. We show that in contrast with the situation for general graphs, the limit set of k-profiles of trees is convex. We initiate a study of the defining inequalities of this convex set. Many challenging problems remain open.
Bibliographical notePublisher Copyright:
© 2015 Wiley Periodicals, Inc.