Let each point of a homogeneous Poisson process in ℝ^d independently be equipped with a random number of stubs (half-edges) according to a given probability distribution μ on the positive integers. We consider translation-invariant schemes for perfectly matching the stubs to obtain a simple graph with degree distribution μ. Leaving aside degenerate cases, we prove that for any μ there exist schemes that give only finite components as well as schemes that give infinite components. For a particular matching scheme which is a natural extension of Gale–Shapley stable marriage, we give sufficient conditions on μ for the absence and presence of infinite components.