On Fan Raspaud Conjecture - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2008

On Fan Raspaud Conjecture

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.
Fichier principal
Vignette du fichier
FanRaspaud.pdf (187.52 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00325258 , version 1 (27-09-2008)

Identifiers

Cite

Jean-Luc Fouquet, Jean-Marie Vanherpe. On Fan Raspaud Conjecture. 2008. ⟨hal-00325258⟩
56 View
73 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More