for a given graph G, there is a set of graphs \mathcal{G} so that for every G’ ∈ \mathcal{G}, the transitive closure of G’ is G. does \mathcal{G} contain only one element?