--
Julien Duron
(LIP)
summary: Given a set of graphs S, a graph U is said to be universal for S if every graph of S is an induced subgraph of U. In particular, the disjoint union of the graphs in S is universal for S. However in many cases there are much better ...
