✦ LIBER ✦

An Equivalent Version of the 3-Flow Conjecture

✍ Scribed by Martin Kochol

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 88 KB
Volume: 83
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2001.2054

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

The input–output version of Aizerman's c

The input–output version of Aizerman's conjecture

✍ M. I. Gil; A. Ailon 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB 👁 2 views

It is proved that non-linear systems with positive impulse functions satisfy the Aizerman conjecture in the input-output version. Besides, the stability criteria are formulated in the terms of the Hurwitzness of corresponding polynomials. In addition, new positivity conditions for impulse functions

An asymptotic version of a conjecture by

An asymptotic version of a conjecture by Enomoto and Ota

✍ Colton Magnant; Daniel M. Martin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

## Abstract In 2000, Enomoto and Ota [J Graph Theory 34 (2000), 163–169] stated the following conjecture. Let __G__ be a graph of order __n__, and let __n__~1~, __n__~2~, …, __n__~__k__~ be positive integers with . If σ~2~(__G__)≥__n__+ __k__−1, then for any __k__ distinct vertices __x__~1~, __x__~

An approximate version of Hadwiger's con

An approximate version of Hadwiger's conjecture for claw-free graphs

✍ Maria Chudnovsky; Alexandra Ovetsky Fradkin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB

## Abstract Hadwiger's conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class of claw‐free graphs (graphs that do not have a vertex with three pairwise nonadjacent neighbors). Our main resul

The equivalence of two conjectures of Be

The equivalence of two conjectures of Berge and Fulkerson

✍ G. Mazzuoccolo 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 65 KB

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.

Integral Versions of the Nakayama and Fi

Integral Versions of the Nakayama and Finitistic Dimension Conjectures

✍ A. Wiedemann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 394 KB

Lenstra′s Proof of the Carlitz-Wan Conje

Lenstra′s Proof of the Carlitz-Wan Conjecture on Exceptional Polynomials: An Elementary Version

✍ S.D. Cohen; M.D. Fried 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 167 KB

We give a proof, following an argument of Lenstra, of the conjecture of Carlitz (1966) as generalized by Wan (1993). This says that there are no exceptional polynomials of degree \(n\) over \(\mathbb{F}_{q}\) if \((n, q-1)>1\). Fried, Guralnick, and Saxl previously proved Carlitz's conjecture: there