15 problems
Delsarte's conjecture. There are no nontrivial perfect codes in Johnson graphs.
Karloff's eigenvalue-range conjecture. The condition in the theorem on the smallest eigenvalue of could be relaxed to
For , let be the full-flag Johnson graph whose vertices are the full flags of , with adjacency when exactly flag components differ. Let be…
The Johnson graph has as its vertices the -element subsets of , with two vertices adjacent when their intersection has cardinality . Write…
Cornet–Dravec–Torres monotonicity conjecture. For every and every ,
Cornet–Dravec–Torres conjecture. For every odd integer ,
Let be the full-flag Johnson graph on the full flags of , where two flags are adjacent exactly when two flag components differ. Its Aldous property means tha…
Chromatic number conjecture for Johnson graphs. This is the remaining case in the known classification of for : the values and are known in the othe…
Lexicode conjecture. Assume that is a power of . The lexicode $$ has cardinality
Let be the -token graph of the complete graph , and let and denote pathwidth and treewidth. Optimal path-decomposition co…
For integers and with , let be the -token graph of the complete graph , also known as the Johnson graph. The tree decomposition of this gr…
Boundary-ratio comparison conjecture. This inequality is valid for all natural numbers .
For integers , , and , let be the graph whose vertices are the -element subsets of , with an edge between two s…
Let be the Johnson graph whose vertices are the -subsets of an -element set, with two vertices adjacent when the corresponding subsets intersect in one element.…
Second-largest eigenvalue conjecture. The subset of eigenvalues of arising as eigenvalues of also includes the second-largest eigenvalue of…