Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 109-119 |
| Number of pages | 11 |
| Journal | Journal of Graph Theory |
| Volume | 81 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Feb 2016 |
Bibliographical note
Publisher Copyright:© 2015 Wiley Periodicals, Inc.