http://openproblemgarden.org/op/bounding_the_on_line_choice_number_in_terms_of_the_choice_number Comments for "Bounding the on-line choice number in terms of the choice number" en http://openproblemgarden.org/op/bounding_the_on_line_choice_number_in_terms_of_the_choice_number <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/zhu_xuding">Zhu</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/vertex_coloring">Vertex coloring</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Question</b>&nbsp;&nbsp; Are there graphs for which <img class="teximage" src="/files/tex/3aa1320c57f076f184f0f05f44e350d3ffea4fa4.png" alt="$ \text{ch}^{\text{OL}}-\text{ch} $" /> is arbitrarily large? </div> </tr></td> </table> </td> </tr> </table> Zhu, Xuding choosability list coloring on-line choosability Graph Theory Coloring Vertex coloring http://openproblemgarden.org/op/bounding_the_on_line_choice_number_in_terms_of_the_choice_number#comment Thu, 11 Apr 2013 16:44:34 +0200 Jon Noel 48583 at http://openproblemgarden.org