Encyclopedia of Combinatorial Polytope Sequences
(4, 0, 0, 0) [polymake for n=4] |
• Cut Polytopes of complete graph CUT(n)= P_C(K_n) [Springer] (Barahona, Mahjoub)[SMAPO library] • Correlation Polytopes COR(n) • convex_hull({incidence_vector_F | F a cut of the complete graph on n nodes}) |
• Dimensions: 1, 3, 6, 10, 15,... (n choose 2) [ OEIS A000217] • Number of Vertices in nth polytope: 2, 4, 8, 16, 32 ... 2^(n-1) [ OEIS A000079] • Number of Facets: 2, 4, 16, 56, 368, 116764, ... OPEN [ OEIS A235459] • f-vectors: 1, 2, 1, 4, 6, 4, 1, 8, 28, 56, 68, 48, 16, 1... [ OEIS ?] |