This page is an entry in an

Encyclopedia of Combinatorial Polytope Sequences



Back to big table.

Asymmetric Traveling Salesman polytope
(No 2d,3d,4d terms.)
Asymmetric Traveling salesman polytopes ATSP(n) [cornell] (L. Billera, A. Sarangarajan)
[science direct] (R. Euler,H. Le Verge)
convex_hull({char_vector_HC | HC a Hamiltonian cycle of the complete digraph on n nodes})
Dimensions:
1, 5, 11, 19 ... n(n-3)+1; n>2
Number of Vertices in polytope for n nodes:
2, 6, 24, 120, ... (n-1)![ OEIS A000142]
Number of Facets:
2, 6, 390, 319015,... OPEN [ OEIS ?]
f-vectors:
1, 2, 1, 6, 15, 20, 15, 6, 1, 24, ... [ OEIS ?]
top    index