cp's OEIS Frontend

A342211 Largest number of maximal acyclic node-induced subgraphs of an n-node graph.

%I A342211 #31 Jul 09 2025 04:55:23
%S A342211 1,1,3,6,10,15,22,38,64
%N A342211 Largest number of maximal acyclic node-induced subgraphs of an n-node graph.
%C A342211 This sequence is log-superadditive, i.e., a(m+n) >= a(m)*a(n). By Fekete's subadditive lemma, it follows that the limit of a(n)^(1/n) exists and equals the supremum of a(n)^(1/n). - _Pontus von Brömssen_, Mar 03 2022
%C A342211 a(10) >= 105.
%H A342211 Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, and Igor Razgon, <a href="https://doi.org/10.1007/s00453-007-9152-0">On the minimum feedback vertex set problem: exact and enumeration algorithms</a>, Algorithmica 52 (2008), 293-307.
%H A342211 Natasha Morrison and Alex Scott, <a href="http://dx.doi.org/10.1016/j.jctb.2017.03.007">Maximising the number of induced cycles in a graph</a>, Journal of Combinatorial Theory Series B 126 (2017), 24-61.
%F A342211 a(m+n) >= a(m)*a(n).
%F A342211 1.5926... = 105^(1/10) <= lim_{n->oo} a(n)^(1/n) <= 1.8638. (Fomin, Gaspers, Pyatkin, and Razgon (2008)).
%e A342211 All optimal graphs (i.e., graphs having n nodes and a(n) maximal acyclic subgraphs) for 1 <= n <= 9 are listed below. Here, FCB(n_1, ..., n_k) denotes the full cyclic braid graph with cluster sizes n_1, ..., n_k, as defined by Morrison and Scott (2017), i.e., the graph obtained by arranging complete graphs of orders n_1, ..., n_k (in that order) in a cycle, and joining all pairs of nodes in neighboring parts with edges. (The graph in the paper by Fomin, Gaspers, Pyatkin, and Razgon, which shows that a(10) >= 105, is FCB(2, 2, 2, 2, 2).)
%e A342211         n = 1: the 1-node graph;
%e A342211         n = 2: the complete graph and the empty graph;
%e A342211   3 <= n <= 6: the complete graph;
%e A342211         n = 7: FCB(1, 2, 2, 2);
%e A342211         n = 8: FCB(1, 2, 1, 2, 2);
%e A342211         n = 9: FCB(1, 2, 2, 1, 3).
%Y A342211 Cf. A000055, A005195.
%Y A342211 Sequences of largest number of maximal induced subgraphs with a given property:
%Y A342211   A000792 (independent sets or cliques),
%Y A342211   this sequence (acyclic),
%Y A342211   A342212 (bipartite),
%Y A342211   A342213 (planar),
%Y A342211   A342324 (chordal),
%Y A342211   A352208 (3-colorable),
%Y A342211   A352209 (perfect),
%Y A342211   A352210 (2-degenerate),
%Y A342211   A352211 (cluster graphs),
%Y A342211   A352212 (triangle-free),
%Y A342211   A352213 (cographs),
%Y A342211   A352214 (claw-free),
%Y A342211   A352215 (C_4-free),
%Y A342211   A352216 (diamond-free).
%K A342211 nonn,more
%O A342211 1,3
%A A342211 _Pontus von Brömssen_, Mar 05 2021