Visible lattice points and the chromatic zeta function of a graph

Abstract

We study the probability that a cycle of length k in the lattice [1, n]^s does not contain more lattice points than the k vertices of the cycle. Then we generalize this problem to other configurations induced by a given graph H, introducting the chromatic zeta fuction of a graph.