2018/05/17 by Mkrtchyan, Vahan V., Vardanyan, Gagik N.
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.1805.06828
The classical Berge-Fulkerson conjecture states that any bridgeless cubic graph G admits a list of six perfect matchings such that each edge of G belongs to two of the perfect matchings from the list. In this short note, we discuss two statements that are consequences of this conjecture. We show that the first statement is equivalent to Fan-Raspaud conjecture. We also show that the smallest counter-example to the second one is a cyclically 4-edge-connected cubic graph.