Let Forb(G) denote the class of graphs with countable vertex sets whic
h do not contain G as a subgraph. If G is finite, 2-connected, but not
complete, then Forb(G) has no element which contains every other elem
ent of Forb(G) as a subgraph, i.e., this class contains no universal g
raph. (C) 1997 John Wiley & Sons, Inc.