REVIEW 2 cited by
Dense $2$-connected planar graphs and the planar Tur\'{a}n number of $2C_k$
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Shi, Walsh and Yu demonstrated that any dense planar graph with certain property (known as circuit graph) contains a large near-triangulation. We extend the result to $2$-connected plane graphs, thereby addressing a question posed by them. Using the result, we prove that the planar Tu\'{a}n number of $2C_k$ is $\left[3-\Theta(k^{\log_23})^{-1}\right]n$ when $k\geq 5$.
Forward citations
Cited by 2 Pith papers
-
Planar Tur\'{a}n numbers of three configurations
Exact planar Turán numbers are established for K1+(P2∪P3), a combined C3/Θ4 configuration, and the disjoint union of C3 and Θ4, with extremal graph characterizations.
-
Planar Tur\'an number of disjoint union of $C_3$ and $C_5$
For n ≥ 295660, the planar Turán number of C3∪C5 is floor((8n-13)/3), and the unique extremal planar graph is described.
Discussion (0). Continue with ORCID to comment.