Lower Bounds for Induced-Universal Graphs

Cyril Gavoille, Amaury Jacques

We give a series of new lower bounds on the minimum number of vertices required by a graph to contain every graph of a given family as induced subgraph. In particular, we show that…