Source: wikibot/kneser-graph
= Kneser graph
{wiki=Kneser_graph}
A Kneser graph \\( K(n, k) \\) is a graph defined using the combinatorial structure of sets. Specifically, it is constructed from the set of all \\( k \\)-element subsets of an \\( n \\)-element set. The vertices of the Kneser graph correspond to these \\( k \\)-element subsets, and two vertices (i.e., subsets) are adjacent if and only if the corresponding subsets are disjoint.