On the local profiles of trees
classification
🧮 math.CO
keywords
treesconvexlocalprofileschallengingcontrastdefininggeneral
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.