On the local profiles of trees
Combinatorics
2014-11-24 v2
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.
Cite
@article{arxiv.1310.5396,
title = {On the local profiles of trees},
author = {Sébastien Bubeck and Nati Linial},
journal= {arXiv preprint arXiv:1310.5396},
year = {2014}
}
Comments
9 pages, minor modifications