Conjecture on optimal gaps in cycle spectra of 3-connected cubic planar graphs
Statement
Let denote the cycle spectrum of a graph , and let the circumference of be the length of its longest cycle. Conjecture on optimal gaps. If with and is a 3-connected cubic planar graph of circumference at least , then
The conjecture would show that the constructions in Section 3 have the largest possible gaps among 3-connected cubic planar graphs. The paper proves the weaker bound with in place of , while the sharp bound remains open.
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.