Year: 2024
Type: article
Abstract: Theplanar Turán numberof a graph is the maximum number of edges in an ‐vertex planar graph without as a subgraph. Let denote the cycle of length . The planar Turán number is known for . We show that dense planar graphs with a certain connectivity property (known as circuit graphs) contain large near triangulations, and we use this result to obtain consequences for planar Turán numbers. In particular, we prove that there is a constant so that for all and . When this bound is tight up to the constant and proves a conjecture of Cranston, Lidický, Liu, and Shantanam.
Source: Journal of Graph Theory
DOI: 10.1002/jgt.23165
Authors: Ruilin Shi, Zach Walsh, Xingxing Yu
Institution: Georgia Institute of Technology
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,950
Funder: National Science Foundation
OpenAlex ID: W4401434652
