|
| |
|
|
A342213
|
|
Largest number of maximal planar node-induced subgraphs of an n-node graph.
|
|
3
|
| |
|
|
|
OFFSET
|
1,5
|
|
|
LINKS
|
Table of n, a(n) for n=1..10.
|
|
|
FORMULA
|
a(m+n) >= a(m)*a(n).
liminf a(n)^(1/n) >= 381^(1/11) = 1.71644... .
|
|
|
EXAMPLE
|
For 4 <= n <= 9, a(n) = binomial(n,4) = A000332(n) and the complete graph is optimal, but a(10) = 211 > 210 = binomial(10,4) with the optimal graph being the complete graph with the edges of two node-disjoint triangles removed. The optimal graph is unique when 5 <= n <= 10.
a(11) >= 381, because the 11-node complete graph with the edges of three node-disjoint triangles removed has 381 maximal planar subgraphs.
|
|
|
CROSSREFS
|
Cf. A000332, A342211, A342212, A342324.
Sequence in context: A341184 A090580 A000332 * A140227 A264925 A049016
Adjacent sequences: A342210 A342211 A342212 * A342214 A342215 A342216
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
Pontus von Brömssen, Mar 05 2021
|
|
|
STATUS
|
approved
|
| |
|
|
