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!)
A284707 Number of maximal independent vertex sets in the n-hypercube graph Q_n. 0
1, 2, 2, 6, 42, 1670, 1281402 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

Duffus, Dwight, Peter Frankl, and Vojtěch Rödl. "Maximal independent sets in bipartite graphs obtained from Boolean lattices." European Journal of Combinatorics 32.1 (2011): 1-9.

Duffus, Dwight, Peter Frankl, and Vojtěch Rödl. "Maximal independent sets in the covering graph of the cube." Discrete Applied Mathematics 161.9 (2013): 1203-1208.

Ilinca, Liviu, and Jeff Kahn. "Counting maximal antichains and independent sets." Order 30.2 (2013): 427-435. Also arXiv:1202.4427, Feb 2012.

Jeff Kahn and Jinyoung Park, The number of maximal independent sets in the Hamming cube, arXiv:1909.04283 [math.CO], Sep 10 2019

LINKS

Table of n, a(n) for n=0..6.

Eric Weisstein's World of Mathematics, Hypercube Graph

Eric Weisstein's World of Mathematics, Independent Vertex Set

Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set

FORMULA

a(n) ~ 2*n*2^(N/4) where N = 2^n [Kahn and Park]. - N. J. A. Sloane, Sep 11 2019

CROSSREFS

Sequence in context: A290957 A032117 A137244 * A174589 A326942 A247943

Adjacent sequences:  A284704 A284705 A284706 * A284708 A284709 A284710

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein, Apr 01 2017

STATUS

approved

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 January 29 16:58 EST 2020. Contains 331347 sequences. (Running on oeis4.)