2013/10/21 by Sébastien Bubeck, Bubeck, Sébastien, Nati Linial +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #math.CO
paper · pdf · doi:10.48550/arxiv.1310.5396
9 pages, minor modifications
openalex publication_date 2013/10/21 · arxiv created 2014/11/21 · arxiv updated 2014/11/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.