1.Previous
3.Next

-vertex-connected.
* forms the vertex-edge graph of an (n - 1)-dimensional polytope, called a hypersimplex.
* Any maximal clique is either of the form for a -element subset and , or of the form for a -element set for , or of the form in the edge case .
* The clique number of is given by an expression in terms of its

1.Previous
3.Next