The Kneser graph Hamiltonicity conjecture
Statement
For integers and with and , let the Kneser graph be the graph whose vertices are the -element subsets of , with an edge between two vertices exactly when the corresponding sets are disjoint. Kneser graph Hamiltonicity conjecture. For any and , except for , the Kneser graph has a Hamilton cycle. This is a classical Hamiltonicity problem for Kneser graphs; the source notes computational confirmation for and a best-known general result, but the full assertion remains 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.