A371162 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A371162

Largest possible number of minimal forbidden subgraphs for a graph of order n.

%I #9 Sep 29 2024 11:55:03

%S 1,1,2,2,4,5,13,33,149

%N Largest possible number of minimal forbidden subgraphs for a graph of order n.

%C a(n) <= A371161(n) + 1.

%H Max A. Alekseyev and Allan Bickle, <a href="https://allanbickle.wordpress.com/wp-content/uploads/2016/05/forbidsubfinal.pdf">Forbidden Subgraphs of Single Graphs</a>, (2024). See p. 17.

%K nonn,more,hard

%O 0,3

%A _Allan Bickle_ and _Max Alekseyev_, Mar 13 2024