Inducibility of \(d\)-ary trees

DOI10.1016/j.disc.2019.111671zbMath1429.05038arXiv1802.03817OpenAlexW2975252268MaRDI QIDQ2279994

Éva Czabarka, Audace A. V. Dossou-Olory, Stephan G. Wagner, László A. Székely

Publication date: 17 December 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

starsinducibilitycaterpillarsmaximum density\(d\)-ary treesleaf-induced subtrees

Mathematics Subject Classification ID

Trees (05C05) Density (toughness, etc.) (05C42)

Related Items

Inducibility and universality for trees ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ Further results on the inducibility of $d$-ary trees ⋮ Inducibility of topological trees

Cites Work

• On the page number of complete odd-partite graphs
• 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 maximal number of induced complete bipartite graphs
• The inducibility of graphs
• The minimum asymptotic density of binary caterpillars
• The maximal number of induced \(r\)-partite subgraphs
• On the Local Profiles of Trees
• The inducibility of complete bipartite graphs
• On the Maximum Induced Density of Directed Stars and Related Problems
• Inducibility of topological trees
• Inducibility in Binary Trees and Crossings in Random Tanglegrams
• The Inducibility of Graphs on Four Vertices
• Unnamed Item
• Unnamed Item
• Unnamed Item