ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For k≥1k\geq 1, let the odd graph K(2k+1,k)K(2k+1,k) be the Kneser graph whose vertices are the kk-element subsets of [2k+1][2k+1], with edges between disjoint sets. Odd graph Hamiltonicity conjecture. For any k≥1k\geq 1, except for k=2k=2, the odd graph K(2k+1,k)K(2k+1,k) has a Hamilton cycle. The exception k=2k=2 is the Petersen graph. The source presents this as a longstanding special case of Kneser graph Hamiltonicity and does not state that it has been resolved.

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.