as well as the structure of the corresponding extremal sets of vertices of a given size, are not fully understood. However, an asymptotically tight lower-bound on expansion of large sets of vertices was recently obtained. In general, determining the chromatic number of a Johnson graph is an open problem. See also Grassmann graph References External links Parametric families of graphs Regular graphs