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

%I #12 Oct 04 2024 23:24:40

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

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

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

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

%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, 2, 3, 2, 2, 1

%e ...

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

%K nonn,tabf

%O 1,2

%A _Max Alekseyev_, Oct 03 2024