ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers n>k≥1n>k\geq 1, let KG⁡(n,k)\operatorname{KG}(n,k) be the graph whose vertices are the kk-subsets of [n][n], with two vertices adjacent exactly when the corresponding sets are disjoint. Two copies are packed into a graph when their edge sets are placed on the same vertex set without overlap. Kneser graph packing conjecture. If two copies of KG⁡(n,k)\operatorname{KG}(n,k) can be packed into the complete graph on (nk)=N\binom{n}{k}=N vertices, then

k=Ω(n).k=\Omega(n).

The paper proves only the weaker lower bound k=Ω(n/(log⁡n)2)k=\Omega(n/(\log n)^2) under the same packing hypothesis. The linear lower bound is presented as an open question related to the sunflower conjecture.

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.