Kneser Representations of Graphs

Abstract

The Kneser graph $K_{n:k}$ for positive integers $n\ge k$ has as its vertex set the k-element subsets of some n-set, with disjoint sets being adjacent. Every finite simple graph can be found as an induced subgraph of some Kneser graph; this article explores some questions arising from that fact.