login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A342213 Largest number of maximal planar node-induced subgraphs of an n-node graph. 3

%I

%S 1,1,1,1,5,15,35,70,126,211

%N Largest number of maximal planar node-induced subgraphs of an n-node graph.

%F a(m+n) >= a(m)*a(n).

%F liminf a(n)^(1/n) >= 381^(1/11) = 1.71644... .

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

%e a(11) >= 381, because the 11-node complete graph with the edges of three node-disjoint triangles removed has 381 maximal planar subgraphs.

%Y Cf. A000332, A342211, A342212, A342324.

%K nonn,more

%O 1,5

%A _Pontus von Brömssen_, Mar 05 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 18 04:41 EDT 2021. Contains 345098 sequences. (Running on oeis4.)