ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a cubic graph, and let ll be the length of a cycle in GG. Cubic-graph cycle-length conjecture. There exist a cycle length ll in GG and a positive integer kk such that

2l≤2k<3l.2l\leq 2^{k}<3l.

The conjecture is motivated by the correspondence between cubic graphs and cubic claw-free graphs without C4C_4, together with the fact that a cycle of length ll in the cubic graph yields cycles of lengths from 2l2l through 3l3l in the associated claw-free graph. The source gives no resolution status, so it is recorded as 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.