Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees

DOI10.1016/j.dam.2021.10.017zbMath1479.05158arXiv2102.11746OpenAlexW3213290792MaRDI QIDQ2057597

Zoltán Lóránt Nagy, Dávid Matolcsi

Publication date: 7 December 2021

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

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

zbMATH Keywords

extremal graphsouterplanar graphsCatalan sequencenumber of subtrees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Outerplanar Turán numbers of cycles and paths

Uses Software

• OEIS

Cites Work

• Greedy trees, subtrees and antichains
• Enumeration of subtrees of trees
• Binary trees with the largest number of subtrees
• Coupon-coloring and total domination in Hamiltonian planar triangulations
• On subtrees of trees
• Extremal values of ratios: distance problems vs. subtree problems in trees. II
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• On the frequency of 3-connected subgraphs of planar graphs
• On the number of cycles of lengthk in a maximal planar graph
• Connectivity, graph minors, and subgraph multiplicity
• Many \(T\) copies in \(H\)-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees