Distance graphs in vector spaces over finite fields, coloring and pseudo-randomness

Abstract

In this paper we systematically study various properties of the distance graph in ${\mathbb{F}}_q^d$, the $d$-dimensional vector space over the finite field ${\mathbb{F}}_q$ with $q$ elements. In the process we compute the diameter of distance graphs and show that sufficiently large subsets of $d$-dimensional vector spaces over finite fields contain every possible finite configurations.

References in corpus (1)

• Explicit Ramsey graphs and Erdos distance problem over finite Euclidean and non-Euclidean spaces

Cited by in corpus (1)

• On the solvability of systems of bilinear equations in finite fields