This page is an entry in an

Encyclopedia of Combinatorial Polytope Sequences



Back to big table.

Bipartite Subgraph Polytope

(4, 3, 0, 0)

• Bipartite Subgraph Polytopes of the complete graph P_B(K_n) = BS(n)
[jstor](F. Barahona, M. Grötschel, A. Mahjoub) [SMAPO library(large subgraphs only)]
• Dimensions:
0, 1, 3, 6, 10 ... (n choose 2)
• Number of Vertices in nth polytope:
1, 2, 7, 41, 376, ... [ OEIS A047864]
• Number of Facets (start at n=1):
0, 2, 7, ...
top    index