The problem of the existence of a universal structure omitting a finite set
of forbidden substructures is reducible to the corresponding problem in th
e category of graphs with a vertex coloring by two colors. It is not known
whether this problem reduces further to the category of ordinary graphs. It
is also not known whether these problems are decidable.