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,2

Links

Table of n, a(n) for n=1..5.

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.

Crossrefs

Cf. A097911, A370002.

Sequence in context: A291178 A023145 A094446 * A071790 A366114 A199465

Adjacent sequences: A370000 A370001 A370002 * A370004 A370005 A370006

Keyword

nonn,more

Author

Pontus von Brömssen, Feb 08 2024

Status

approved