Premium
On the Local Profiles of Trees
Author(s) -
Bubeck Sébastien,
Linial Nati
Publication year - 2016
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21865
Subject(s) - mathematics , combinatorics , regular polygon , set (abstract data type) , limit (mathematics) , contrast (vision) , tree (set theory) , convex set , discrete mathematics , computer science , convex optimization , geometry , artificial intelligence , mathematical analysis , programming language
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.