LONG PATHS IN THE DISTANCE GRAPH OVER LARGE SUBSETS OF VECTOR SPACES OVER FINITE FIELDS

Let , the d-dimensional vector space over the finite field with q elements. Construct a graph, called the distance graph of E, by letting the vertices be the elements of E and connect a pair of vertices corresponding to vectors x, y 2 E by an edge if ${\parallel}x-y{\parallel}: