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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.