

A097911


Minimal order of a graph containing as induced subgraphs isomorphic copies of all graphs on n unlabeled nodes.


3




OFFSET

1,2


COMMENTS

A graph that contains as induced subgraphs isomorphic copies of all graphs in a family F is called induced universal for F.  James Trimble, Nov 09 2021


LINKS



EXAMPLE

a(3) = 5 as (P1 + K1)*K1 + K1 has 5 vertices and is easily seen minimal for 3. Here P1 is the path with one edge and K1 is an isolated vertex.


CROSSREFS



KEYWORD

more,nonn


AUTHOR

Dan Schwarz (dan_schwarz(AT)hotmail.com), Sep 04 2004


EXTENSIONS



STATUS

approved



