On the local profiles of trees

DOI10.1002/JGT.21865MaRDI QIDQ3466358zbMATH OpenOpenAlexFDO

Authors Sébastien Bubeck, Nathan Linial

Publication date 1 February 2016

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.5396

zbMATH Keywords

\(k\)-profiles of trees

Mathematics Subject Classification ID

Trees (05C05)

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.

Recommendations

• Paths vs. stars in the local profile of trees
• On the 3-local profiles of graphs
• Tree limits and limits of random trees
• On the profile of random trees
• The profile of unlabeled trees

Cites work

• Flag algebras
• Undecidability of linear inequalities in graph homomorphism densities

Cited in

(14)

• Strong forms of stability from flag algebra calculations
• The feasible region of induced graphs
• Inducibility of \(d\)-ary trees
• On the number of 4-cycles in a tournament
• On the number of nonisomorphic subtrees of a tree
• A note on the inducibility of 4-vertex graphs
• Further results on the inducibility of d-ary trees
• Inducibility and universality for trees
• Paths vs. stars in the local profile of trees
• Inducibility of topological trees
• Inducibility in binary trees and crossings in random tanglegrams
• On the 3-local profiles of graphs
• Subgraph densities in a surface
• Getting to the root of the problem: sums of squares for limits of trees

This page was built for publication: On the local profiles of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3466358)