Intersection graph
= Intersection graph
{wiki}
An <intersection graph> has one <vertex> for each member of a family of <sets>. Two distinct <vertices> have an <edge> exactly when their associated <sets> have a nonempty <intersection>. A <clique> therefore describes pairwise intersections; it need not give a single element common to all those <sets>.