  It is well known that the coefficients of the matching polynomial are
unimodal. Unimodality of the coefficients (or their absolute values) of other
graph polynomials have been studied as well. Recently I. Beaton and J. Brown
(2020) proved the for almost all graphs the coefficients of the domination
polynomial form a unimodal sequence.
  Let $P$ be a graph property, and let $p_i(G)$ be the number of induced
subgraphs of order $i$ of a graph $G$ which are in $P$. Inspired by their
result we prove: \\ {\bf Theorem:} If $P$ is the complement of a hereditary
property, then for almost all graphs in $G(n, \frac{1}{2})$ the sequence
$p_i(G)$ is unimodal.
