http://openproblemgarden.org/op/large_induced_forest_in_a_planar_graph Comments for "Large induced forest in a planar graph." en http://openproblemgarden.org/op/large_induced_forest_in_a_planar_graph <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/abertson_michael_o">Abertson</a>; <a href="/category/berman_david_m">Berman</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a> » <a href="/category/topological_graph_theory">Topological G.T.</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 planar graph on <img class="teximage" src="/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png" alt="$ n $" /> verices has an induced forest with at least <img class="teximage" src="/files/tex/c67419f4fb8ac8785445c343f82ca86899007338.png" alt="$ n/2 $" /> vertices. </div> </tr></td> </table> </td> </tr> </table> Abertson, Michael O. Berman, David M. Graph Theory Topological Graph Theory http://openproblemgarden.org/op/large_induced_forest_in_a_planar_graph#comment Mon, 04 Mar 2013 09:21:57 +0100 fhavet 46634 at http://openproblemgarden.org