Unions of perfect matchings in cubic graphs

Abstract

We show that every cubic bridgeless graph contains two perfect matching covering at least 3/5 of its edges (the bound is the best possible) and discuss unions of three perfect matchings.

Keywords

• Unions
• perfect
• matchings
• cubic
• graphs