The fractional stable set polytope FRAC(G) of a simple graph G with
d vertices is a rational polytope that is the set of nonnegative vectors
(x1,…,xd) satisfying xi+xj≤1 for every edge (i,j) of G. In
this paper we show that (i) The δ-vector of a lattice polytope $2 {\rm
FRAC}(G)isalternatinglyincreasing;(ii)TheEhrhartringof{\rm FRAC}(G)isGorenstein;(iii)ThecoefficientsofthenumeratoroftheEhrhartseriesof{\rm FRAC}(G)aresymmetric,unimodalandcomputedbythe\delta−vectorof2 {\rm FRAC}(G)$.