http://openproblemgarden.org/op/good_edge_labeling_and_girth Comments for "Good edge labeling and girth" en http://openproblemgarden.org/op/good_edge_labeling_and_girth#comment-7217 <p>http://epubs.siam.org/doi/abs/10.1137/11085414X</p> Sat, 15 Sep 2012 00:21:26 +0200 Anonymous comment 7217 at http://openproblemgarden.org http://openproblemgarden.org/op/good_edge_labeling_and_girth#comment-7197 <p>Mehrabian, SIAM J Discrete Math, 2012. </p> Thu, 09 Aug 2012 13:49:26 +0200 Anonymous comment 7197 at http://openproblemgarden.org http://openproblemgarden.org/op/good_edge_labeling_and_girth <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/bode_farzad_theis">Bode-Farzad-Theis</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a> » <a href="/category/coloring">Coloring</a> » <a href="/category/labeling">Labeling</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 graph with large girth has a good edge labeling. </div> <p> More specifically: there exists a constant <img class="teximage" src="/files/tex/4239ee4145983e1d8ad375f0606cc7140bce36a3.png" alt="$ g $" /> such that every graph with girth at least <img class="teximage" src="/files/tex/4239ee4145983e1d8ad375f0606cc7140bce36a3.png" alt="$ g $" /> has a good edge labeling. </p> </tr></td> </table> </td> </tr> </table> Bode-Farzad-Theis good edge labeling, edge labeling Graph Theory Coloring Labeling http://openproblemgarden.org/op/good_edge_labeling_and_girth#comment Tue, 13 Sep 2011 22:42:13 +0200 DOT 37346 at http://openproblemgarden.org