  In this paper we present a concrete counterexample to the conjecture of
Kontsevich about the polynomial countability of graph hypersurfaces. In
contrast to this, we show that the "wheel with spokes" graphs $WS_n$ are
polynomially countable.
