𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Restrictions On Smallest Counterexamples To The 5-Flow Conjecture

✍ Scribed by Martin Kochol*

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
154 KB
Volume
26
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Sternfeld-Levin counterexamples t
On the Sternfeld-Levin counterexamples to a conjecture of Chogoshvili-Pontrjagin
✍ Fredric D. Ancel; Tadeusz Dobrowolski πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 854 KB

An inconclusive proof in a 1937 paper by G. Chogoshvili spawned an interesting dimensiontheoretic conjecture which we call the Chogoshvili-Pontrjagin Conjecture. In 1991, Y. Stemfeld found an ingenious counterexample to this conjecture which he and M. Levin greatly generalized in 1995. In this note

On the strong circular 5-flow conjecture
On the strong circular 5-flow conjecture
✍ Edita MÑčajovΓ‘; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 163 KB

## Abstract The Strong Circular 5‐flow Conjecture of Mohar claims that each snarkβ€”with the sole exception of the Petersen graphβ€”has circular flow number smaller than 5. We disprove this conjecture by constructing an infinite family of cyclically 4‐edge connected snarks whose circular flow number eq

A counterexample to a conjecture on the
A counterexample to a conjecture on the bondage number of a graph
✍ Ulrich Teschner πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 113 KB

The bondage number h(G) of a nonempty graph G was first introduced by Fink, Jacobson, Kinch and Roberts in [3]. They generalized a former approach to domination-critical graphs, In their publication they conjectured that b(G)<d(G)+ 1 for any nonempty graph G.