Universal graph

Universal graph --- универсальный граф.

Among a family of graphs [math]\displaystyle{ {\mathcal H} }[/math], a graph [math]\displaystyle{ G }[/math] is called universal, if any graph in [math]\displaystyle{ {\mathcal H} }[/math] is isomorphic to an induced subgraph of [math]\displaystyle{ G }[/math], and is called [math]\displaystyle{ w }[/math]-universal, if any graph in [math]\displaystyle{ {\mathcal H} }[/math] is isomorphic to a subgraph of [math]\displaystyle{ G }[/math].