On Fan Raspaud Conjecture

Details On Fan Raspaud Conjecture On Fan Raspaud Conjecture

2008-09-28

arxiv.org/abs/0809.4821v1

Computer Science

Discrete Mathematics

Scientific paper

A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph con-tains three perfect matchings with empty intersection. Kaiser and Raspaud [6] sug-gested 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.

Affiliated with

Also associated with

No associations

Rating

On Fan Raspaud Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Fan Raspaud Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Fan Raspaud Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353589