The bipartite Kneser graph Hamiltonicity conjecture
Statement
For integers and with and , let the bipartite Kneser graph have as vertices all -element and all -element subsets of , with an edge between two vertices exactly when one corresponding set is a subset of the other. Bipartite Kneser graph Hamiltonicity conjecture. For any and , the bipartite Kneser graph has a Hamilton cycle. The conjecture is presented as a longstanding Hamiltonicity problem; no resolution is supplied in the source.
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.