In the mathematical discipline of graph theory Petersen's theorem, named after Julius Petersen, states that every cubic, bridgeless graph contains a perfect matching.
In the mathematical discipline of graph theory Petersen's theorem, named after Julius Petersen, is one of the earliest results. Every cubic, bridgeless graph contains a perfect matching.