login
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.
2

%I #8 Oct 04 2024 23:23:51

%S 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,

%T 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,

%U 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

%N 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.

%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.

%e Table starts with

%e n = 1: 1

%e n = 2: 2, 1

%e n = 3: 2, 2, 2, 1

%e n = 4: 2, 3, 4, 4, 3, 2, 1

%e ...

%Y Cf. A371162 (row maximums).

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

%K nonn,tabf

%O 1,2

%A _Max Alekseyev_, Oct 03 2024