http://openproblemgarden.org/op/the_borodin_kostochka_conjecture Comments for "The Borodin-Kostochka Conjecture" en http://openproblemgarden.org/op/the_borodin_kostochka_conjecture <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/borodin_oleg_v">Borodin</a>; <a href="/category/kostochka_alexandr_v">Kostochka</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</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 maximum degree <img class="teximage" src="/files/tex/bdef913d8b11dd941503a47d9902308ca0f4a15a.png" alt="$ \Delta \geq 9 $" /> has chromatic number at most <img class="teximage" src="/files/tex/aec77cc3837a98ea739a3c68e7e7ba5d90ec8cc4.png" alt="$ \max\{\Delta-1, \omega\} $" />. </div> </tr></td> </table> </td> </tr> </table> Borodin, Oleg V. Kostochka, Alexandr V. Graph Theory http://openproblemgarden.org/op/the_borodin_kostochka_conjecture#comment Mon, 10 Sep 2012 23:50:09 +0200 Andrew King 37670 at http://openproblemgarden.org