Affordable Access

The weak 3-flow conjecture and the weak circular flow

Authors
Publisher
Academic Press
Publication Date
Keywords
  • We Show That
  • For Each Natural Number K&Gt
  • 1
  • Every Graph (Possibly With Multiple Edges But With No Loops) Of Edge-Connectivity At Least 2K2+K Has
  • For K=3 The Edge-Connectivity 8 Suffices
  • This Implies The Weak 3-Flow Conjecture Proposed In 1988 By Jaeger (A Natural Weakening Of TutteʼS
  • It Also Implies The Tree-Decomposition Conjecture Proposed In 2006 By Bárat And Thomassen When Rest
  • Finally
  • It Is The Currently Strongest Partial Result On The (2+ϵ)-Flow Conjecture By Goddyn And Seymour

Abstract

The weak 3-flow conjecture and the weak circular flow - DTU Orbit (14/02/14) The weak 3-flow conjecture and the weak circular flow - DTU Orbit (14/02/14) Thomassen, C. (2012). The weak 3-flow conjecture and the weak circular flow. Journal of Combinatorial Theory. Series B, 102(2), 521-529. 10.1016/j.jctb.2011.09.003

There are no comments yet on this publication. Be the first to share your thoughts.