Cranston et al.'s revised planar Turán conjecture for cycles
Statement
Let be the cycle on vertices, and let denote the maximum number of edges in an -vertex planar graph containing no copy of as a subgraph. Let be a constant. Cranston et al.'s revised conjecture. There exists a constant such that for all and all sufficiently large , we have
This revised conjecture was proposed after the earlier conjecture of Ghosh et al. was disproved for 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.