  In this paper we study the kaleidoscopic pseudo-randomness of finite
Euclidean graphs using probabilistic methods. Roughly speaking, we show that
sufficiently large subsets of d-dimensional vector spaces over finite fields
contain every possible finite configurations.
