Open Problem Garden - Forcing a $K_6$-minor - Comments

Open Problem Garden - Forcing a $K_6$-minor - Comments http://openproblemgarden.org/op/forcing_a_k_6_minor Comments for "Forcing a $K_6$-minor" en Forcing a $K_6$-minor http://openproblemgarden.org/op/forcing_a_k_6_minor <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/barat_janos">Barát </a>; <a href="/category/joret_gwenael">Joret</a>; <a href="/category/wood_david_r">Wood</a>   </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a> » <a href="/category/basic_graph_theory">Basic G.T.</a> » <a href="/category/minors">Minors</a>   </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Conjecture</b>   Every graph with minimum degree at least 7 contains a <img class="teximage" src="/files/tex/ba39f6d33baf4500a21bc1905745d7c0414444e6.png" alt="$ K_6 $" />-minor. </div> <div class="envtheorem"><b>Conjecture</b>   Every 7-connected graph contains a <img class="teximage" src="/files/tex/ba39f6d33baf4500a21bc1905745d7c0414444e6.png" alt="$ K_6 $" />-minor. </div> </tr></td> </table> </td> </tr> </table> Barát ,János Joret, Gwenaël Wood, David R. connectivity graph minors Graph Theory Basic Graph Theory Minors http://openproblemgarden.org/op/forcing_a_k_6_minor#comment Mon, 16 Jan 2012 03:44:14 +0100 David Wood 37379 at http://openproblemgarden.org