The following section provides information concerning the Kneser Graph family.

Definition:

The Kneser graph K(n,k) is the graph whose vertices represent the k-subsets of {1,...,n}, and where two vertices are connected if and only if they correspond to disjoint subsets.

Consider removing a vertex option from the column player, how will that then affect the game value?

The color green represents a decrease in the game value if the vertex is chosen, red represents an increase in the game value if the vertex is chosen, and blue represents no change in the game value.