Kneser graph packing conjecture
Statement
For integers , let be the graph whose vertices are the -subsets of , 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 can be packed into the complete graph on vertices, then
The paper proves only the weaker lower bound 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.