http://openproblemgarden.org/op/2_epsilon_flow_conjecture Comments for "(2 + epsilon)-flow conjecture" en http://openproblemgarden.org/op/2_epsilon_flow_conjecture#comment-93637 <p>The <img class="teximage" src="/files/tex/b87f46fde0334fc27aa793c3c3a982410876046c.png" alt="$ (2+\epsilon) $" />-flow conjecture is a consequence of the weak circular flow conjecture which was proved in</p> <p>[T] C.Thomassen, The weak 3-flow conjecture and the weak circular flow conjecture, J.Combinatorial Theory B 102 (2012) 521-529.</p> <p>The paper [LTWZ] gives an improved bound.</p> Wed, 19 Feb 2020 11:15:09 +0100 Anonymous comment 93637 at http://openproblemgarden.org http://openproblemgarden.org/op/2_epsilon_flow_conjecture <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/goddyn">Goddyn</a>; <a href="/category/seymour">Seymour</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a> » <a href="/category/coloring">Coloring</a> » <a href="/category/flows">Nowhere-zero flows</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Conjecture</b>&nbsp;&nbsp; For every <img class="teximage" src="/files/tex/b1b64614e8f5ba1571715ad1ac108f193e820416.png" alt="$ \epsilon&gt;0 $" /> there exists an integer <img class="teximage" src="/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png" alt="$ k $" /> so that every <img class="teximage" src="/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png" alt="$ k $" />-<a href="http://en.wikipedia.org/wiki/connectivity (graph theory)">edge-connected</a> graph has a <img class="teximage" src="/files/tex/9195fc458719a5ff4e5445cc211c173d24f4d1ca.png" alt="$ (2+\epsilon) $" />-flow. </div> </tr></td> </table> </td> </tr> </table> Goddyn, Luis A. Seymour, Paul D. edge-connectivity flow Graph Theory Coloring Nowhere-zero flows http://openproblemgarden.org/op/2_epsilon_flow_conjecture#comment Wed, 07 Mar 2007 10:21:32 +0100 mdevos 129 at http://openproblemgarden.org