http://openproblemgarden.org/op/large_acyclic_induced_subdigraph_in_a_planar_oriented_graph Comments for "Large acyclic induced subdigraph in a planar oriented graph." en http://openproblemgarden.org/op/large_acyclic_induced_subdigraph_in_a_planar_oriented_graph <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/harutyunyan_ararat">Harutyunyan</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a> » <a href="/category/directed_graphs">Directed 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 planar oriented graph <img class="teximage" src="/files/tex/b8653a25aff72e3dacd3642492c24c2241f0058c.png" alt="$ D $" /> has an acyclic induced subdigraph of order at least <img class="teximage" src="/files/tex/5a32f551bf4043e68e6d6a234d5683ce8fff1aea.png" alt="$ \frac{3}{5} |V(D)| $" />. </div> </tr></td> </table> </td> </tr> </table> Harutyunyan, Ararat Graph Theory Directed Graphs http://openproblemgarden.org/op/large_acyclic_induced_subdigraph_in_a_planar_oriented_graph#comment Tue, 25 Jun 2013 20:06:36 +0200 fhavet 52197 at http://openproblemgarden.org