The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #10 Feb 11 2024 09:15:21
%S 1,2,4,7,9
%N 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.
%H Mathematics Stack Exchange, <a href="https://math.stackexchange.com/questions/75209/">What is the smallest graph that contains all non-isomorphic 4-node and 5-node connected graphs as induced subgraphs?</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Universal_graph">Universal graph</a>.
%Y Cf. A097911, A370002.
%K nonn,more
%O 1,2
%A _Pontus von Brömssen_, Feb 08 2024