Let Forb(G) denote the class of graphs with countable vertex sets which 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 element of Forb(G) as a subgraph, i.e., this class contains no universal graph.
|Number of pages||6|
|Journal||Journal of Graph Theory|
|Publication status||Published - May 1997|
ASJC Scopus subject areas
- Geometry and Topology