ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CkC_k be the cycle on kk vertices, and let ex⁡P(n,Ck)\operatorname{ex}_{\mathcal{P}}(n,C_k) denote the maximum number of edges in an nn-vertex planar graph containing no copy of CkC_k as a subgraph. Let dd be a constant. Cranston et al.'s revised conjecture. There exists a constant dd such that for all kk and all sufficiently large nn, we have

ex⁡P(n,Ck)≤3n−6−dnklog⁡23.\operatorname{ex}_{\mathcal{P}}(n,C_k)\le 3n-6-\frac{dn}{k^{\log_2 3}}.

This revised conjecture was proposed after the earlier conjecture of Ghosh et al. was disproved for k≥11k\ge 11 by Cranston, Lidický, Liu and Shantanam, and independently by Lan and Song. The paper presents it as a proposed asymptotic upper bound for planar Turán numbers of cycles.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.