Open Problem Garden - Does every subcubic triangle-free graph have fractional chromatic number at most 14/5? - Comments https://openproblemgarden.org/op/does_every_subcubic_triangle_free_graph_have_fractional_chromatic_number_at_most_14_5 Comments for "Does every subcubic triangle-free graph have fractional chromatic number at most 14/5?" en This conjecture has recently (re: Does every subcubic triangle-free graph have fractional chromatic number at most 14/5?) https://openproblemgarden.org/op/does_every_subcubic_triangle_free_graph_have_fractional_chromatic_number_at_most_14_5#comment-7858 <p>This conjecture has recently been proved by Dvorak, Sereni and Volec.</p> <p>Frederic Havet</p> Sat, 02 Mar 2013 07:49:47 +0100 fhavet comment 7858 at https://openproblemgarden.org Does every subcubic triangle-free graph have fractional chromatic number at most 14/5? https://openproblemgarden.org/op/does_every_subcubic_triangle_free_graph_have_fractional_chromatic_number_at_most_14_5 <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/heckman_christopher_c">Heckman</a>; <a href="/category/thomas">Thomas</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>Conjecture</b>&nbsp;&nbsp; Every triangle-free graph with maximum degree at most 3 has fractional chromatic number at most 14/5. </div> </tr></td> </table> </td> </tr> </table> Heckman, Christopher C. Thomas, Robin fractional coloring Graph Theory Coloring Vertex coloring https://openproblemgarden.org/op/does_every_subcubic_triangle_free_graph_have_fractional_chromatic_number_at_most_14_5#comment Wed, 20 Apr 2011 22:00:22 +0200 Andrew King 37313 at https://openproblemgarden.org