<?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 - spanning trees - Comments</title>
 <link>http://openproblemgarden.org/op/spanning_trees</link>
 <description>Comments for &quot;spanning trees&quot;</description>
 <language>en</language>
<item>
 <title>Solution by Ruben van der Zwaan  (re: spanning trees)</title>
 <link>http://openproblemgarden.org/op/spanning_trees#comment-6969</link>
 <description>&lt;p&gt;Where is the solution posted?&lt;/p&gt;
</description>
 <pubDate>Fri, 20 May 2011 23:37:38 +0200</pubDate>
 <dc:creator>Anonymous</dc:creator>
 <guid isPermaLink="false">comment 6969 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>definition  (re: spanning trees)</title>
 <link>http://openproblemgarden.org/op/spanning_trees#comment-6756</link>
 <description>&lt;p&gt;adjacent to at least one leaf.&lt;/p&gt;
</description>
 <pubDate>Sat, 03 Jul 2010 13:57:18 +0200</pubDate>
 <dc:creator>leshabirukov</dc:creator>
 <guid isPermaLink="false">comment 6756 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>definition?  (re: spanning trees)</title>
 <link>http://openproblemgarden.org/op/spanning_trees#comment-6755</link>
 <description>&lt;p&gt;what is a support vertex?&lt;/p&gt;
</description>
 <pubDate>Fri, 02 Jul 2010 17:58:42 +0200</pubDate>
 <dc:creator>Anonymous</dc:creator>
 <guid isPermaLink="false">comment 6755 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>spanning trees</title>
 <link>http://openproblemgarden.org/op/spanning_trees</link>
 <description>&lt;table cellspacing=&quot;10&quot;&gt;
&lt;tr&gt;
  &lt;td&gt;
    Author(s):
        &lt;a href=&quot;/kpz_equation_central_limit_theorem&quot;&gt;&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;&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;Problem&lt;/b&gt;&amp;nbsp;&amp;nbsp; Prove or disprove: Let &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt; be a graph with the minimum vertex degree at least 2; that is, &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/96ae81fb0087a7e4c2537972b978fb0cfb8a7c59.png&quot; alt=&quot;$ \delta(G)\geq 2 $&quot; /&gt;. Then there exists a spanning tree &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/79f55d2e1d83a7726c807a70cbe756713b0437b6.png&quot; alt=&quot;$ T $&quot; /&gt; of &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt; such that for every support vertex &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/96cbd9a16c6a5eab03815b093b08f3b2db614e9a.png&quot; alt=&quot;$ v $&quot; /&gt; in &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/79f55d2e1d83a7726c807a70cbe756713b0437b6.png&quot; alt=&quot;$ T $&quot; /&gt; if &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/71888edb7df1a28db99d1bb63045685a6a06f9f0.png&quot; alt=&quot;$ \deg_G(v)\geq 3 $&quot; /&gt;, then &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/8a6e3c2c3e888b71a237fa0f69ab0002188b5fcb.png&quot; alt=&quot;$ \deg_T(v)\geq 3 $&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/spanning_trees">spanning trees</category>
 <category domain="http://openproblemgarden.org/category/graph_theory">Graph Theory</category>
 <comments>http://openproblemgarden.org/op/spanning_trees#comment</comments>
 <pubDate>Fri, 02 Jul 2010 16:41:00 +0200</pubDate>
 <dc:creator>akhodkar</dc:creator>
 <guid isPermaLink="false">37231 at http://openproblemgarden.org</guid>
</item>
</channel>
</rss>
