On Fan Raspaud Conjecture
Discrete Mathematics
2008-09-30 v1
Abstract
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.
Keywords
Cite
@article{arxiv.0809.4821,
title = {On Fan Raspaud Conjecture},
author = {Jean-Luc Fouquet and Jean-Marie Vanherpe},
journal= {arXiv preprint arXiv:0809.4821},
year = {2008}
}