In the mathematical discipline of graph theory, Petersen's theorem, named after Julius Petersen, states that every cubic, bridgeless graph contains a perfect matching.. That is, if a graph has exactly three edges at each vertex, and every edge belongs to a cycle, then it has a set of edges that touches every vertex exactly once.