ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C(G)\mathcal{C}(G) denote the cycle spectrum of a graph GG, and let the circumference of GG be the length of its longest cycle. Conjecture on optimal gaps. If k∈Nk\in\mathbb{N} with k≥2k\geq 2 and GG is a 3-connected cubic planar graph of circumference at least kk, then

C(G)∩[k,2k+2]≠∅.\mathcal{C}(G)\cap [k,2k+2]\neq\emptyset.

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 2k+92k+9 in place of 2k+22k+2, 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 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.