On Fan Raspaud Conjecture

Simple item page
dc.creatorFouquet, Jean-Luc
dc.creatorVanherpe, Jean-Marie
dc.date2008-09-28
dc.date.accessioned2026-07-07T10:06:03Z
dc.date.available2026-07-07T10:06:03Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/0809.4821
dc.identifierhttp://arxiv.org/abs/0809.4821
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/170196
dc.subjectDiscrete Mathematics
dc.titleOn Fan Raspaud Conjecture
dc.typetext

Files

Collections

arXiv