<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xml:base="http://openproblemgarden.org" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
 <title>Open Problem Garden - Bounding the chromatic number of triangle-free graphs with fixed maximum degree - Comments</title>
 <link>http://openproblemgarden.org/op/bounding_the_chromatic_number_of_triangle_free_graphs_with_fixed_maximum_degree</link>
 <description>Comments for &quot;Bounding the chromatic number of triangle-free graphs with fixed maximum degree&quot;</description>
 <language>en</language>
<item>
 <title>Modifying the conjecture  (re: Bounding the chromatic number of triangle-free graphs with fixed maximum degree)</title>
 <link>http://openproblemgarden.org/op/bounding_the_chromatic_number_of_triangle_free_graphs_with_fixed_maximum_degree#comment-93641</link>
 <description>&lt;p&gt;From Reed&#039;s conjecture, it seems that the ceiling has to be replaced by flooring. Thanks.&lt;/p&gt;
</description>
 <pubDate>Sat, 16 May 2020 08:33:16 +0200</pubDate>
 <dc:creator>Anonymous</dc:creator>
 <guid isPermaLink="false">comment 93641 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>Bounding the chromatic number of triangle-free graphs with fixed maximum degree</title>
 <link>http://openproblemgarden.org/op/bounding_the_chromatic_number_of_triangle_free_graphs_with_fixed_maximum_degree</link>
 <description>&lt;table cellspacing=&quot;10&quot;&gt;
&lt;tr&gt;
  &lt;td&gt;
    Author(s):
        &lt;a href=&quot;/category/kostochka_alexandr_v&quot;&gt;Kostochka&lt;/a&gt;; &lt;a href=&quot;/category/reed_bruce_a&quot;&gt;Reed&lt;/a&gt;&amp;nbsp;&amp;nbsp;
  &lt;/td&gt;
  &lt;td align=right&gt;
    Subject:
        &lt;a href=&quot;/category/graph_theory&quot;&gt;Graph Theory&lt;/a&gt; » &lt;a href=&quot;/category/coloring&quot;&gt;Coloring&lt;/a&gt; » &lt;a href=&quot;/category/vertex_coloring&quot;&gt;Vertex coloring&lt;/a&gt;&amp;nbsp;&amp;nbsp;
  &lt;/td&gt;
&lt;/tr&gt;

&lt;tr&gt;
  &lt;td colspan=2&gt;
    &lt;table border=1 cellspacing=&quot;5&quot;&gt;
      &lt;tr&gt;&lt;td&gt;
        &lt;div class=&quot;envtheorem&quot;&gt;&lt;b&gt;Conjecture&lt;/b&gt;&amp;nbsp;&amp;nbsp; A triangle-free graph with maximum degree &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/e3f8e135c571143e94f1d4f236326b862080b200.png&quot; alt=&quot;$ \Delta $&quot; /&gt; has chromatic number at most &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/522a3a86b51cce46cfcff77891e669d1b9ff9147.png&quot; alt=&quot;$ \ceil{\frac{\Delta}{2}}+2 $&quot; /&gt;.&lt;/p&gt;
&lt;/div&gt;

      &lt;/tr&gt;&lt;/td&gt;
    &lt;/table&gt;
  &lt;/td&gt;
&lt;/tr&gt;
&lt;/table&gt;</description>
 <category domain="http://openproblemgarden.org/category/kostochka_alexandr_v">Kostochka, Alexandr V.</category>
 <category domain="http://openproblemgarden.org/category/reed_bruce_a">Reed, Bruce A.</category>
 <category domain="http://openproblemgarden.org/category/chromatic_number">chromatic number</category>
 <category domain="http://openproblemgarden.org/category/girth">girth</category>
 <category domain="http://openproblemgarden.org/category/maximum_degree">maximum degree</category>
 <category domain="http://openproblemgarden.org/category/triangle_free">triangle free</category>
 <category domain="http://openproblemgarden.org/category/graph_theory">Graph Theory</category>
 <category domain="http://openproblemgarden.org/category/coloring">Coloring</category>
 <category domain="http://openproblemgarden.org/category/vertex_coloring">Vertex coloring</category>
 <comments>http://openproblemgarden.org/op/bounding_the_chromatic_number_of_triangle_free_graphs_with_fixed_maximum_degree#comment</comments>
 <pubDate>Fri, 17 Apr 2009 14:37:46 +0200</pubDate>
 <dc:creator>Andrew King</dc:creator>
 <guid isPermaLink="false">36907 at http://openproblemgarden.org</guid>
</item>
</channel>
</rss>
