http://openproblemgarden.org/op/edge_disjoint_hamilton_cycles Comments for "Edge-disjoint Hamilton cycles in highly strongly connected tournaments." en http://openproblemgarden.org/op/edge_disjoint_hamilton_cycles <table cellspacing="10"> <tr> <td> Author(s): <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> » <a href="/category/tournaments">Tournaments</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/13bc863dca3c6b96ebfd2de373f0fe820c58b62b.png" alt="$ k\geq 2 $" />, there is an integer <img class="teximage" src="/files/tex/e055b3867e7cb3cc4b2f50739eedda7657999214.png" alt="$ f(k) $" /> so that every strongly <img class="teximage" src="/files/tex/e055b3867e7cb3cc4b2f50739eedda7657999214.png" alt="$ f(k) $" />-connected tournament has <img class="teximage" src="/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png" alt="$ k $" /> edge-disjoint Hamilton cycles. </div> </tr></td> </table> </td> </tr> </table> Thomassen, Carsten Graph Theory Directed Graphs Tournaments http://openproblemgarden.org/op/edge_disjoint_hamilton_cycles#comment Fri, 08 Mar 2013 06:08:09 +0100 fhavet 47031 at http://openproblemgarden.org