The odd graph Hamiltonicity conjecture
Statement
For , let the odd graph be the Kneser graph whose vertices are the -element subsets of , with edges between disjoint sets. Odd graph Hamiltonicity conjecture. For any , except for , the odd graph has a Hamilton cycle. The exception 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.