http://openproblemgarden.org/op/jorgensens_conjecture Comments for "Jorgensen's Conjecture" en http://openproblemgarden.org/op/jorgensens_conjecture <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/jorgensen">Jorgensen</a>&nbsp;&nbsp; </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>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Conjecture</b>&nbsp;&nbsp; Every 6-<a href="http://en.wikipedia.org/wiki/connectivity (graph theory)">connected</a> graph without a <a href="http://en.wikipedia.org/wiki/complete graph"><img class="teximage" src="/files/tex/ba39f6d33baf4500a21bc1905745d7c0414444e6.png" alt="$ K_6 $" /></a> <a href="http://en.wikipedia.org/wiki/minor (graph theory)">minor</a> is apex (planar plus one vertex). </div> </tr></td> </table> </td> </tr> </table> Jorgensen, Leif K. connectivity minor Graph Theory Basic Graph Theory Minors http://openproblemgarden.org/op/jorgensens_conjecture#comment Sat, 10 Mar 2007 15:17:00 +0100 mdevos 154 at http://openproblemgarden.org