Kaiser-Raspaud Conjecture on Cubic Graphs with few vertices
نویسنده
چکیده
A conjecture of Kaiser and Raspaud [6] asserts (in a special form due to Má cajová and Skoviera) that every bridgeless cubic graph has two perfect matchings whose intersection does not contain any odd edge cut. We prove this conjecture for graphs with few vertices and we give a stronger result for traceable graphs.
منابع مشابه
On Fan Raspaud Conjecture
A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. Kaiser and Raspaud [6] suggested a possible approach to this problem based on the concept of a balanced join in an embedded graph. We give here some new results concerning this conjecture and prove that a minimum counterexample must have at least 32 vertices.
متن کاملNon-intersecting perfect matchings in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problems of this type, based on the concept of a balanced join in an embedded graph. We use this method to prove a special case of a conjecture of E. Máčajová and M. Škoviera on Fano colorings of cubic graphs.
متن کاملPerfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problems of this type, based on the concept of a balanced join in an embedded graph. We use this method to prove that bridgeless cubic graphs of oddness two have Fano colorings using only 5 lines of the Fano plane. This is a ...
متن کاملPerfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture
Let m∗t be the largest rational number such that every bridgeless cubic graph G associated with a positiveweightω has t perfectmatchings {M1, . . . ,Mt}withω(∪i=1 Mi) ≥ m ∗ t ω(G). It is conjectured in this paper that m∗3 = 4 5 , m ∗ 4 = 14 15 , and m ∗ 5 = 1, which are called the weighted PM-covering conjectures. The counterparts of this new invariant m∗t and conjectures for unweighted cubic g...
متن کاملThe Fan-Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks
It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them. We show a randomized algorithmic way of finding Fan–Raspaud colorings of a given cubic graph and, analyzing the computer results, we try to find and describe the Fan–Raspaud colorings for some selected classes of cubic graphs. The p...
متن کامل