<?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 - Negative association in uniform forests - Comments</title>
 <link>http://openproblemgarden.org/op/negative_association_in_uniform_forests</link>
 <description>Comments for &quot;Negative association in uniform forests&quot;</description>
 <language>en</language>
<item>
 <title>Negative association in uniform forests</title>
 <link>http://openproblemgarden.org/op/negative_association_in_uniform_forests</link>
 <description>&lt;table cellspacing=&quot;10&quot;&gt;
&lt;tr&gt;
  &lt;td&gt;
    Author(s):
        &lt;a href=&quot;/category/pemantle_robin&quot;&gt;Pemantle&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/random_graphs&quot;&gt;Probabilistic 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;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/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt; be a finite graph, let &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/785dc08a907b3bfba9d96f51396e90572dfbc853.png&quot; alt=&quot;$ e,f \in E(G) $&quot; /&gt;, and let &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/bfff269cc7df9bdb7c57d8b6a2a74020d114f24d.png&quot; alt=&quot;$ F $&quot; /&gt; be the edge set of a forest chosen uniformly at random from all forests of &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt;.  Then &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/1fe7ac9c579238670e3aa16ae401e8194e1c3da3.png&quot; alt=&quot;\[ {\mathbb P}(e \in F \mid f \in F}) \le {\mathbb P}(e \in F) \]&quot; /&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/pemantle_robin">Pemantle, Robin</category>
 <category domain="http://openproblemgarden.org/category/forest">forest</category>
 <category domain="http://openproblemgarden.org/category/negative_association">negative association</category>
 <category domain="http://openproblemgarden.org/category/graph_theory">Graph Theory</category>
 <category domain="http://openproblemgarden.org/category/random_graphs">Probabilistic Graph Theory</category>
 <comments>http://openproblemgarden.org/op/negative_association_in_uniform_forests#comment</comments>
 <pubDate>Mon, 30 Jun 2008 13:36:49 +0200</pubDate>
 <dc:creator>mdevos</dc:creator>
 <guid isPermaLink="false">1757 at http://openproblemgarden.org</guid>
</item>
</channel>
</rss>
