A376781 Triangular table read by rows: T(n,k) is the maximum 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, 4, 4, 3, 2, 1, 2, 3, 4, 5, 5, 5, 5, 4, 3, 2, 1, 2, 3, 4, 6, 8, 8, 9, 13, 11, 11, 9, 6, 5, 3, 2, 1, 2, 3, 4, 6, 8, 8, 11, 16, 20, 23, 28, 31, 30, 33, 24, 22, 15, 10, 7, 3, 2, 1, 2, 3, 4, 6, 8, 9, 14, 21, 24, 31, 41, 57, 78, 86, 106, 123, 134, 149, 143, 138, 133, 75, 46, 37, 18, 11, 3, 2, 1

Offset: 1

Author

Max Alekseyev, Oct 03 2024

Keywords

• nonn
• tabf

Examples

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

Links

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

Crossrefs

Cf. A371162 (row maximums).

Cf. A002865, A006897, A103221, A371161, A376780, A376782.