A376780 Triangular table read by rows: T(n,k) is the minimum number of minimal forbidden subgraphs of a graph with n vertices and k edges, n >= 1, 0 <= k <= n*(n-1)/2.

1, 2, 1, 2, 2, 2, 1, 2, 3, 2, 3, 2, 2, 1, 2, 3, 2, 3, 3, 4, 3, 3, 2, 2, 1, 2, 3, 3, 2, 4, 3, 4, 5, 5, 4, 5, 5, 4, 2, 2, 1, 2, 3, 3, 2, 4, 4, 3, 4, 5, 4, 5, 5, 7, 6, 6, 5, 5, 4, 4, 2, 2, 1, 2, 3, 3, 3, 2, 4, 4, 3, 5, 6, 5, 6, 5, 5, 7, 6, 7, 10, 9, 9, 9, 8, 10, 5, 5, 4, 2, 2, 1

Offset

1,2

Links

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

Max A. Alekseyev and Allan Bickle, Forbidden Subgraphs of Single Graphs, 2024.

Example

Table starts with
n = 1: 1
n = 2: 2, 1
n = 3: 2, 2, 2, 1
n = 4: 2, 3, 2, 3, 2, 2, 1
...

Crossrefs

Cf. A002865, A006897, A103221, A371161, A371162, A376781, A376782.

Sequence in context: A303401 A327491 A099910 * A213325 A043555 A242753

Adjacent sequences: A376777 A376778 A376779 * A376781 A376782 A376783

Keyword

nonn,tabf

Author

Max Alekseyev, Oct 03 2024

Status

approved