✦ LIBER ✦

The equivalence of two conjectures of Berge and Fulkerson

✍ Scribed by G. Mazzuoccolo

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 65 KB
Volume: 68
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20545

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a bridgeless cubic graph. Fulkerson conjectured that there exist six 1-factors of G such that each edge of G is contained in exactly two of them. Berge conjectured that the edge-set of G can be covered with at most five 1-factors. We prove that the two conjectures are equivalent.

📜 SIMILAR VOLUMES

Equivalence of Fleischner's and Thomasse

Equivalence of Fleischner's and Thomassen's Conjectures

✍ Martin Kochol 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 96 KB

We show that conjectures of Thomassen (every 4-connected line graph is hamiltonian) and Fleischner (every cyclically 4-edge-connected cubic graph has either a 3-edge-coloring or a dominating cycle) are equivalent.

An Equivalent Version of the 3-Flow Conj

An Equivalent Version of the 3-Flow Conjecture

✍ Martin Kochol 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 88 KB

The 3-flow conjecture of Tutte is that every bridgeless graph without a 3-edge cut has a nowhere-zero 3-flow. We show that it suffices to prove this conjecture for 5-edge-connected graphs.

Counterexamples to two conjectures of Hi

Counterexamples to two conjectures of Hilton

✍ S. Fiorini 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract Counterexamples are presented to the following two conjectures of Hilton: A graph which does not contain a spanning __K__~1t~ is Vl‐critical if and only if it is VC‐critical. If __G__ is a class‐two graph which contains a spanning Pl‐critical subgraph __H__ of the same chromatic index

On the Equivalence of two Classification

On the Equivalence of two Classification Rules

✍ A. K. Gupta 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 2 views

A unified approach to known and unknown

A unified approach to known and unknown cases of Berge's conjecture

✍ Eli Berger; Irith Ben-Arroyo Hartman 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract Berge's elegant dipath partition conjecture from 1982 states that in a dipath partition __P__ of the vertex set of a digraph minimizing , there exists a collection __C__^__k__^ of __k__ disjoint independent sets, where each dipath __P__∈__P__ meets exactly min{|__P__|, __k__} of the ind

TWO TOPOLOGICAL EQUIVALENTS OF THE AXIOM

TWO TOPOLOGICAL EQUIVALENTS OF THE AXIOM OF CHOICE

✍ Eric Schechter; E. Schechter 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB 👁 1 views

## Abstract We show that the Axiom of Choice is equivalent to each of the following statements: (i) A product of closures of subsets of topological spaces is equal to the closure of their product (in the product topology); (ii) A product of complete uniform spaces is complete.