Many recent results in combinatorics concern the relationship between the size of a set and the number of distances determined by pairs of points in the set. One extension of this question considers configurations within the set with a specified pattern of distances.

In this talk, I will use graph-theoretic techniques to answer some of these questions.