A decomposition of 2-weak vertex-packing polytopes

The 2-weak vertex-packing polytope of a loopless graphG withd vertices is the subset of the unitd-cube satisfyingx _i +x _j ≤1 for every edge (i,j) ofG. The dilation by 2 of this polytope is a polytope with integral vertices. We triangulate with lattice simplices of minimal volume and label the maximal simplices with elements of the hyperoctahedral groupB _d . This labeling gives rise to a shelling of the triangulation of , where theh-vector of (and the Ehrharth ^*-vector of can be computed as a descent statistic on a subset ofB _d defined in terms ofG. A recursive way of computing theh-vector of is also given, and a recursive formula for the volume of . This work was partially supported by grants from the Icelandic Council of Science and the Royal Swedish Academy of Sciences, respectively.