Further results on the inducibility of $d$-ary trees

zbMath1482.05042arXiv1811.11235MaRDI QIDQ5026962

Audace A. V. Dossou-Olory, Stephan G. Wagner

Publication date: 8 February 2022

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

zbMATH Keywords

leaf-induced subtreesleaves of a rooted tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (2)

The minimum asymptotic density of binary caterpillars ⋮ Inducibility of topological trees

Cites Work

• Unnamed Item
• The inducibility of blow-up graphs
• A note on the inducibility of 4-vertex graphs
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• The inducibility of graphs
• The minimum asymptotic density of binary caterpillars
• Inducibility of \(d\)-ary trees
• On the Local Profiles of Trees
• On the inducibility of small trees
• Inducibility in Binary Trees and Crossings in Random Tanglegrams
• The Inducibility of Graphs on Four Vertices

This page was built for publication: Further results on the inducibility of $d$-ary trees