Planar Turán numbers of cycles: a counterexample

Abstract: The planar Turan number

e x t r m {e x}_{m a t h c a l P} (C_{e l l}, n)

is the largest number of edges in an

n

-vertex planar graph with no

e l l

-cycle. For

e l l i n 3, 4, 5, 6

, upper bounds on

e x t r m {e x}_{m a t h c a l P} (C_{e l l}, n)

are known that hold with equality infinitely often. Ghosh, Gy"{o}ri, Martin, Paulo, and Xiao [arxiv:2004.14094] conjectured an upper bound on

e x t r m {e x}_{m a t h c a l P} (C_{e l l}, n)

for every

e l l g e 7

and

n

sufficiently large. We disprove this conjecture for every

e l l g e 11

. We also propose two revised versions of the conjecture.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

Cites Work

Cited In (8)

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