<?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 - Exponentially many perfect matchings in cubic graphs - Comments</title>
 <link>http://openproblemgarden.org/op/exponentially_many_perfect_matchings_in_cubic_graphs</link>
 <description>Comments for &quot;Exponentially many perfect matchings in cubic graphs&quot;</description>
 <language>en</language>
<item>
 <title>Preprint up on arXiv  (re: Exponentially many perfect matchings in cubic graphs)</title>
 <link>http://openproblemgarden.org/op/exponentially_many_perfect_matchings_in_cubic_graphs#comment-6878</link>
 <description>&lt;p&gt;The paper is now available in preprint form on arXiv.  http://arxiv.org/abs/1012.2878&lt;/p&gt;
</description>
 <pubDate>Wed, 15 Dec 2010 21:09:21 +0100</pubDate>
 <dc:creator>Andrew King</dc:creator>
 <guid isPermaLink="false">comment 6878 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>Conjecture proven  (re: Exponentially many perfect matchings in cubic graphs)</title>
 <link>http://openproblemgarden.org/op/exponentially_many_perfect_matchings_in_cubic_graphs#comment-6857</link>
 <description>&lt;p&gt;The conjecture has recently been proven by Esperet, Kardos, King, Kral and Norine. The paper is now being prepared for publication.&lt;/p&gt;
</description>
 <pubDate>Mon, 08 Nov 2010 22:25:03 +0100</pubDate>
 <dc:creator>Anonymous</dc:creator>
 <guid isPermaLink="false">comment 6857 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>Exponentially many perfect matchings in cubic graphs</title>
 <link>http://openproblemgarden.org/op/exponentially_many_perfect_matchings_in_cubic_graphs</link>
 <description>&lt;table cellspacing=&quot;10&quot;&gt;
&lt;tr&gt;
  &lt;td&gt;
    Author(s):
        &lt;a href=&quot;/category/lovasz&quot;&gt;Lovasz&lt;/a&gt;; &lt;a href=&quot;/category/plummer_michael_d&quot;&gt;Plummer&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/basic_graph_theory&quot;&gt;Basic G.T.&lt;/a&gt; » &lt;a href=&quot;/category/matchings_0&quot;&gt;Matchings&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; There exists a fixed constant &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/dccee841f3f498c2c58fa6ae1c1403c5a88c5b8d.png&quot; alt=&quot;$ c $&quot; /&gt; so that every &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png&quot; alt=&quot;$ n $&quot; /&gt;-vertex cubic graph without a cut-edge has at least &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/22656fabb8498ada6bf54e6068c4978436afcc8f.png&quot; alt=&quot;$ e^{cn} $&quot; /&gt; perfect matchings. &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/lovasz">Lovasz, Laszlo</category>
 <category domain="http://openproblemgarden.org/category/plummer_michael_d">Plummer, Michael D.</category>
 <category domain="http://openproblemgarden.org/category/cubic">cubic</category>
 <category domain="http://openproblemgarden.org/category/perfect_matching">perfect matching</category>
 <category domain="http://openproblemgarden.org/category/graph_theory">Graph Theory</category>
 <category domain="http://openproblemgarden.org/category/basic_graph_theory">Basic Graph Theory</category>
 <category domain="http://openproblemgarden.org/category/matchings_0">Matchings</category>
 <comments>http://openproblemgarden.org/op/exponentially_many_perfect_matchings_in_cubic_graphs#comment</comments>
 <pubDate>Mon, 30 Jun 2008 12:39:54 +0200</pubDate>
 <dc:creator>mdevos</dc:creator>
 <guid isPermaLink="false">1755 at http://openproblemgarden.org</guid>
</item>
</channel>
</rss>
