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 Kneser graph K(n,k)K(n,k) be the graph whose vertices are the kk-element subsets of [n]:={1,2,…,n}[n]:=\{1,2,\ldots,n\}, with an edge between two vertices exactly when the corresponding sets are disjoint. Kneser graph Hamiltonicity conjecture. For any k≥1k\geq 1 and n≥2k+1n\geq 2k+1, except for (n,k)=(5,2)(n,k)=(5,2), the Kneser graph K(n,k)K(n,k) has a Hamilton cycle. This is a classical Hamiltonicity problem for Kneser graphs; the source notes computational confirmation for n≤27n\leq 27 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 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.