<?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 - Complexity of the H-factor problem. - Comments</title>
 <link>http://openproblemgarden.org/op/complexity_of_the_h_factor_problem</link>
 <description>Comments for &quot;Complexity of the H-factor problem.&quot;</description>
 <language>en</language>
<item>
 <title>Complexity of the H-factor problem.</title>
 <link>http://openproblemgarden.org/op/complexity_of_the_h_factor_problem</link>
 <description>&lt;table cellspacing=&quot;10&quot;&gt;
&lt;tr&gt;
  &lt;td&gt;
    Author(s):
        &lt;a href=&quot;/category/kuhn_daniella&quot;&gt;Kühn&lt;/a&gt;; &lt;a href=&quot;/category/osthus_deryk&quot;&gt;Osthus&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/extremal_graph_theory&quot;&gt;Extremal G.T.&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;p&gt;An &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/76c7b422c8e228780f70a4f31614cfcf3f831c65.png&quot; alt=&quot;$ H $&quot; /&gt;-factor in a graph &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt; is a set of vertex-disjoint copies of &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/76c7b422c8e228780f70a4f31614cfcf3f831c65.png&quot; alt=&quot;$ H $&quot; /&gt; covering all vertices of &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt;.&lt;br /&gt;
&lt;div class=&quot;envtheorem&quot;&gt;&lt;b&gt;Problem&lt;/b&gt;&amp;nbsp;&amp;nbsp;Let &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/dccee841f3f498c2c58fa6ae1c1403c5a88c5b8d.png&quot; alt=&quot;$ c $&quot; /&gt; be a fixed positive real number and &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/76c7b422c8e228780f70a4f31614cfcf3f831c65.png&quot; alt=&quot;$ H $&quot; /&gt; a fixed graph. Is it NP-hard to determine whether a graph &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt; on &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png&quot; alt=&quot;$ n $&quot; /&gt; vertices and minimum degree &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/d86cd3be7381a5c384b9e02ce96029e79af296a1.png&quot; alt=&quot;$ cn $&quot; /&gt; contains and &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/76c7b422c8e228780f70a4f31614cfcf3f831c65.png&quot; alt=&quot;$ H $&quot; /&gt;-factor?&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/kuhn_daniella">Kühn, Daniella</category>
 <category domain="http://openproblemgarden.org/category/osthus_deryk">Osthus, Deryk</category>
 <category domain="http://openproblemgarden.org/category/graph_theory">Graph Theory</category>
 <category domain="http://openproblemgarden.org/category/extremal_graph_theory">Extremal Graph Theory</category>
 <comments>http://openproblemgarden.org/op/complexity_of_the_h_factor_problem#comment</comments>
 <pubDate>Tue, 05 Mar 2013 09:23:26 +0100</pubDate>
 <dc:creator>fhavet</dc:creator>
 <guid isPermaLink="false">46738 at http://openproblemgarden.org</guid>
</item>
</channel>
</rss>
