http://openproblemgarden.org/op/3_flow_conjecture Comments for "3-flow conjecture" en http://openproblemgarden.org/op/3_flow_conjecture#comment-6952 <p>Carsten Thomassen recently (Christmas 2010) proved the weak 3-flow conjecture for k=8. </p> Tue, 12 Apr 2011 14:42:27 +0200 Flo Pfender comment 6952 at http://openproblemgarden.org http://openproblemgarden.org/op/3_flow_conjecture <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/tutte">Tutte</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; Every 4-<a href="http://en.wikipedia.org/wiki/connectivity (graph theory)">edge-connected</a> graph has a <a href="http://en.wikipedia.org/wiki/nowhere-zero flows">nowhere-zero</a> 3-flow. </div> </tr></td> </table> </td> </tr> </table> Tutte, William T. nowhere-zero flow Graph Theory Coloring Nowhere-zero flows http://openproblemgarden.org/op/3_flow_conjecture#comment Wed, 07 Mar 2007 09:38:17 +0100 mdevos 128 at http://openproblemgarden.org