A370003 Least number of vertices of a universal graph for connected n-vertex graphs, i.e., a graph containing as induced subgraphs isomorphic copies of all connected n-vertex graphs.
1, 2, 4, 7, 9
Offset: 1
Links
- Mathematics Stack Exchange, What is the smallest graph that contains all non-isomorphic 4-node and 5-node connected graphs as induced subgraphs?
- Wikipedia, Universal graph.