http://openproblemgarden.org/op/seymours_self_minor_conjecture Comments for "Seymour's self-minor conjecture" en http://openproblemgarden.org/op/seymours_self_minor_conjecture#comment-6721 <p>The real problem, of course, is to prove Seymour's Conjectre for countable graphs (which suffices for the Graph Minor Theorem). Note that Oporowski's example involves uncountable many vertices.</p> Thu, 15 Apr 2010 15:36:48 +0200 Anonymous comment 6721 at http://openproblemgarden.org http://openproblemgarden.org/op/seymours_self_minor_conjecture#comment-6719 <p>This conjecture has been shown to be false:</p> <p>B. Oporowski, 'A counterexample to Seymour's self-minor conjecture.' Journal of Graph Theory, (14) 5 (521--524)</p> Sun, 04 Apr 2010 23:30:18 +0200 Anonymous comment 6719 at http://openproblemgarden.org http://openproblemgarden.org/op/seymours_self_minor_conjecture <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/seymour">Seymour</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a> » <a href="/category/infinite_graphs">Infinite 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; Every infinite graph is a proper <a href="http://en.wikipedia.org/wiki/minor (graph theory)">minor</a> of itself. </div> </tr></td> </table> </td> </tr> </table> Seymour, Paul D. infinite graph minor Graph Theory Infinite Graphs http://openproblemgarden.org/op/seymours_self_minor_conjecture#comment Tue, 22 May 2007 19:39:37 +0200 mdevos 333 at http://openproblemgarden.org