The code and experiment protocols for counting maximal independent sets in the hypercube covergraph.
- Part 1. Counting maximal independent sets up to n=6 (https://oeis.org/A284707).
- Part 2. Computing maximal independent set polynomials up to n=6.
The concept lattices of the contexts (*.cxt) contains all maximal bicliques in the conplemented adjacency matrices of n-hypercube Q_n.
- Dmitry I. Ignatov, On the Maximal Independence Polynomial of the Covering Graph of the Hypercube up to n = 6, Int'l Conf. Formal Concept Analysis, 2023.
NB. Any usage of the codes and data requires the acknowledgment of this repository and the paper.