ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph in G(k)\mathcal{G}(k), where G(k)\mathcal{G}(k) denotes the class of connected kk-regular graphs whose vertices have at most kk vertices at distance two, and suppose that GG is locally connected, meaning that the neighborhood of every vertex induces a connected graph. Fully cycle extendable conjecture. If k≥9k\geq 9, then GG is fully cycle extendable: every vertex of GG belongs to a triangle, and for every non-Hamiltonian cycle CC in GG there is a cycle C′C' such that V(C)⊂V(C′)V(C)\subset V(C') and ∣V(C′)∣=∣V(C)∣+1|V(C')|=|V(C)|+1. This would extend known Hamiltonicity results for locally connected graphs in this class; the supplied text gives no resolution of the conjecture.

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.