Planar Turán numbers of short paths

DOI10.1007/s00373-019-02055-wzbMath1426.05070OpenAlexW2950510925MaRDI QIDQ2334068

Yongxin Lan, Yongtang Shi

Publication date: 6 November 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02055-w

zbMATH Keywords

pathTurán numberplanar Turán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (8)

The Turán numbers of special forests ⋮ Extremal \(P_8\)-free/\(P_9\)-free planar graphs ⋮ Outerplanar Turán numbers of cycles and paths ⋮ Planar Turán number of the disjoint union of cycles ⋮ Rainbow numbers for paths in planar graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ Planar Turán numbers on short cycles of consecutive lengths ⋮ The generalized Turán number of spanning linear forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
• Turán problems and shadows. I: Paths and cycles
• Connected graphs without long paths
• Compactness results in extremal graph theory
• Cycles of even length in graphs
• Path Ramsey numbers in multicolorings
• Extremal Theta-free planar graphs
• Extremal \(H\)-free planar graphs
• Hypergraph Turán numbers of linear cycles
• ExtremalC₄-Free/C₅-Free Planar Graphs
• On the structure of linear graphs

This page was built for publication: Planar Turán numbers of short paths