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 special case of a conjecture by E. Máčajová and M. Škoviera.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کامل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.
متن کاملM\'acajov\'a and \v{S}koviera Conjecture on Cubic Graphs
A conjecture of M\'a\u{c}ajov\'a and \u{S}koviera asserts 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.
متن کامل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.
متن کاملA New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
We prove that every n-vertex cubic bridgeless graph has at least n/2 perfect matchings and give a list of all 17 such graphs that have less than n/2 + 2 perfect matchings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 31 شماره
صفحات -
تاریخ انتشار 2010