The cubic-graph cycle-length conjecture for powers of two
Statement
Let be a cubic graph, and let be the length of a cycle in . Cubic-graph cycle-length conjecture. There exist a cycle length in and a positive integer such that
The conjecture is motivated by the correspondence between cubic graphs and cubic claw-free graphs without , together with the fact that a cycle of length in the cubic graph yields cycles of lengths from through 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.