Planar Turán numbers of cycles: a counterexample

DOI10.37236/10774zbMath1496.05077arXiv2110.02043OpenAlexW4293298833WikidataQ124983644 ScholiaQ124983644MaRDI QIDQ2170782

Xiaonan Liu, Bernard Lidický, Daniel W. Cranston, Abhinav Shantanam

Publication date: 6 September 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

extremal planar graphplanar 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)

Related Items (3)

Outerplanar Turán numbers of cycles and paths ⋮ Planar Turán numbers of cubic graphs and disjoint union of cycles ⋮ Planar Turán number of the disjoint union of cycles

Cites Work

• Unnamed Item
• Long cycles in 3-connected graphs
• Planar Turán number of intersecting triangles
• Extremal Theta-free planar graphs
• Extremal \(H\)-free planar graphs
• Simple paths on polyhedra
• ExtremalC₄-Free/C₅-Free Planar Graphs
• Proofs from THE BOOK

This page was built for publication: Planar Turán numbers of cycles: a counterexample