http://openproblemgarden.org/op/highly_arc_transitive_two_ended_digraphs Comments for "Highly arc transitive two ended digraphs" en http://openproblemgarden.org/op/highly_arc_transitive_two_ended_digraphs <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/cameron_peter_j">Cameron</a>; <a href="/category/praeger_cheryl_e">Praeger</a>; <a href="/category/wormald_nicholas_c">Wormald</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a> » <a href="/category/infinite_graphs">Infinite 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; If <img class="teximage" src="/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png" alt="$ G $" /> is a highly arc transitive digraph with two ends, then every tile of <img class="teximage" src="/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png" alt="$ G $" /> is a disjoint union of complete bipartite graphs. </div> </tr></td> </table> </td> </tr> </table> Cameron, Peter J. Praeger, Cheryl E. Wormald, Nicholas C. arc transitive digraph infinite graph Graph Theory Infinite Graphs http://openproblemgarden.org/op/highly_arc_transitive_two_ended_digraphs#comment Mon, 29 Oct 2007 18:18:10 +0100 mdevos 691 at http://openproblemgarden.org