ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite simple graph. Its circumference c(G)c(G) is the length of a longest cycle, its induced circumference c′(G)c'(G) is the length of a longest induced cycle, and δ(G)\delta(G) denotes its minimum degree. A graph is 22-connected if it remains connected after deletion of any one vertex, and a wheel is a graph formed from a cycle by adding a new vertex adjacent to every vertex of the cycle.

Wheel characterization conjecture. Let GG be a 22-connected graph with

δ(G)≥3.\delta(G)\geq 3.

Then c(G)=c′(G)+1c(G)=c'(G)+1 if and only if GG is a wheel.

The source states that this conjecture is equivalent to the non-Hamiltonian form of Harvey's conjecture. It isolates wheels as the unique Hamiltonian graphs in the relevant class whose two cycle parameters differ by exactly one.

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.