Cycles in the lattice with visible steps and the chromatic zeta function of a graph
Javier Cilleruelo · arXiv (Cornell University) · 2015
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 con?gurations induced by a given graph H introducting the chromatic zeta fuction of a graph.