How do you show a graph has a complete matching?

How do you show a graph has a complete matching (i know that it has to satisfy hall's marriage theorem but how do you show that? do you just have to write out showing that all k subsets of V1 connect to k vertices in V2?)