ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers nn and kk with k≥1k\geq 1 and n≥2k+1n\geq 2k+1, let the bipartite Kneser graph H(n,k)H(n,k) have as vertices all kk-element and all (n−k)(n-k)-element subsets of [n]:={1,2,…,n}[n]:=\{1,2,\ldots,n\}, with an edge between two vertices exactly when one corresponding set is a subset of the other. Bipartite Kneser graph Hamiltonicity conjecture. For any k≥1k\geq 1 and n≥2k+1n\geq 2k+1, the bipartite Kneser graph H(n,k)H(n,k) 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 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.