# TADM2E 9.13

From Algorithm Wiki

Revision as of 18:24, 11 September 2014 by Algowikiadmin (Talk | contribs)

Construction:

Label the vertices 1 to n Let S be the set {1,2,3,...n}

The subsets C :

1 subset for each edge {u,v} which contains the number labels of u and v.

proofs up to you.