Extremal Theta-free planar graphs
From MaRDI portal
Publication:2329195
DOI10.1016/j.disc.2019.111610zbMath1422.05037arXiv1711.01614OpenAlexW2965928990WikidataQ127400264 ScholiaQ127400264MaRDI QIDQ2329195
Zi-Xia Song, Yongtang Shi, Yongxin Lan
Publication date: 17 October 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.01614
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (15)
The Turán numbers of special forests ⋮ Planar Turán numbers of cycles: a counterexample ⋮ Generalized planar Turán numbers ⋮ Planar Turán Number of the 6-Cycle ⋮ Extremal \(P_8\)-free/\(P_9\)-free planar graphs ⋮ Outerplanar Turán numbers of cycles and paths ⋮ Planar Turán numbers of cubic graphs and disjoint union of cycles ⋮ Unnamed Item ⋮ Rainbow numbers for paths in planar graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ On the Turán number of theta graphs ⋮ Planar anti-Ramsey numbers of paths and cycles ⋮ Planar Turán numbers on short cycles of consecutive lengths ⋮ Planar Turán numbers of short paths ⋮ Planar Turán number of intersecting triangles
Cites Work
- 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
- Planar anti-Ramsey numbers of paths and cycles
- Hypergraph Turán numbers of linear cycles
- ExtremalC4-Free/C5-Free Planar Graphs
- Rainbow Numbers for Cycles in Plane Triangulations
- On the structure of linear graphs
This page was built for publication: Extremal Theta-free planar graphs