On some perfect matching conjectures in infinite, cubic, bridgeless graphs

Paulo Magalhães Júnior, Antonio Kelson Silva

The Berge-Fulkerson Conjecture states that every bridgeless cubic graph has six perfect matchings such that each edge belongs to exactly two of them. This conjecture has remained o…