We study the probability that the edges of a random cycle of k vertices in the lattice $${\{1,\ldots,n\}^s}$$ do not contain more lattice points than the k vertices of the cycle. Then we introduce the chromatic zeta function of a graph to generalize this problem to other configurations induced by a given graph $${\mathcal H}$$ .