|
Search: id:A058975
|
|
|
| A058975 |
|
Total number of flats in the lattice of contractions of the n-cube. Also number of partitions of vertex set of n-cube into blocks all of which induce connected subgraphs. |
|
+0
1
|
| |
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
J. N. Cooper, unpublished.
|
|
EXAMPLE
|
There are twelve contractions of the 2-cube, also known as the 4-cycle. The edge sets along which the contractions occur are: no edges, any one of the four single edges, one of two opposite pairs, one of four pairs of intersecting edges and all edges.
|
|
CROSSREFS
|
Sequence in context: A129933 A064320 A112373 this_sequence A057120 A112512 A006751
Adjacent sequences: A058972 A058973 A058974 this_sequence A058976 A058977 A058978
|
|
KEYWORD
|
hard,nonn,nice
|
|
AUTHOR
|
Joshua N. Cooper (jcooper(AT)math.ucsd.edu), Jan 15 2001
|
|
|
Search completed in 0.002 seconds
|
