<?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 - Characterizing (aleph_0,aleph_1)-graphs - Comments</title>
 <link>http://openproblemgarden.org/op/characterizing_aleph_0_aleph_1_graphs</link>
 <description>Comments for &quot;Characterizing (aleph_0,aleph_1)-graphs&quot;</description>
 <language>en</language>
<item>
 <title>Re: problem claimed to be solved by scott streit texas professor  (re: Characterizing (aleph_0,aleph_1)-graphs)</title>
 <link>http://openproblemgarden.org/op/characterizing_aleph_0_aleph_1_graphs#comment-7088</link>
 <description>&lt;p&gt;Please be more specific: who claims it a where? If I googled the right Scott Streit, he doesn&#039;t seem to be the kind of person interested in this kind of problems. &lt;/p&gt;
&lt;p&gt;Best wishes,    Robert&lt;/p&gt;
</description>
 <pubDate>Thu, 24 Nov 2011 16:39:35 +0100</pubDate>
 <dc:creator>Robert Samal</dc:creator>
 <guid isPermaLink="false">comment 7088 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>problem claimed to be solved by scott streit texas professor  (re: Characterizing (aleph_0,aleph_1)-graphs)</title>
 <link>http://openproblemgarden.org/op/characterizing_aleph_0_aleph_1_graphs#comment-7074</link>
 <description>&lt;p&gt;Has his solution ever been viewed/reviewed?  He claims to have solved it with his students&lt;/p&gt;
</description>
 <pubDate>Mon, 21 Nov 2011 01:28:33 +0100</pubDate>
 <dc:creator>Anonymous</dc:creator>
 <guid isPermaLink="false">comment 7074 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>Characterizing (aleph_0,aleph_1)-graphs</title>
 <link>http://openproblemgarden.org/op/characterizing_aleph_0_aleph_1_graphs</link>
 <description>&lt;table cellspacing=&quot;10&quot;&gt;
&lt;tr&gt;
  &lt;td&gt;
    Author(s):
        &lt;a href=&quot;/category/diestel_reinhard&quot;&gt;Diestel&lt;/a&gt;; &lt;a href=&quot;/category/leader&quot;&gt;Leader&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/infinite_graphs&quot;&gt;Infinite Graphs&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;Call a graph an &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/4170402299493c216234845dcc59a455da96e488.png&quot; alt=&quot;$ (\aleph_0,\aleph_1) $&quot; /&gt;-&lt;em&gt;graph&lt;/em&gt; if it has a bipartition &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/e0150654d2f6aa6b2ea50e726af4747878a605fc.png&quot; alt=&quot;$ (A,B) $&quot; /&gt; so that every vertex in &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/7a8d9782350e8eb5a84c149576d83160492cbdd3.png&quot; alt=&quot;$ A $&quot; /&gt; has degree &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/ae61eb32cc3c2cd0fc395f5f137af2ecebcc6f92.png&quot; alt=&quot;$ \aleph_0 $&quot; /&gt; and every vertex in &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/4369e4eb2b0938fb27436a8c4f4a062f83d4d49e.png&quot; alt=&quot;$ B $&quot; /&gt; has degree &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/ad5e05aff060f8c4118554ec23fc051e0cfbfd7f.png&quot; alt=&quot;$ \aleph_1 $&quot; /&gt;.  &lt;/p&gt;
&lt;div class=&quot;envtheorem&quot;&gt;&lt;b&gt;Problem&lt;/b&gt;&amp;nbsp;&amp;nbsp; Characterize the &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/4170402299493c216234845dcc59a455da96e488.png&quot; alt=&quot;$ (\aleph_0,\aleph_1) $&quot; /&gt;-graphs. &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/diestel_reinhard">Diestel, Reinhard</category>
 <category domain="http://openproblemgarden.org/category/leader">Leader, Imre</category>
 <category domain="http://openproblemgarden.org/category/binary_tree">binary tree</category>
 <category domain="http://openproblemgarden.org/category/infinite_graph">infinite graph</category>
 <category domain="http://openproblemgarden.org/category/normal_spanning_tree">normal spanning tree</category>
 <category domain="http://openproblemgarden.org/category/set_theory">set theory</category>
 <category domain="http://openproblemgarden.org/category/graph_theory">Graph Theory</category>
 <category domain="http://openproblemgarden.org/category/infinite_graphs">Infinite Graphs</category>
 <comments>http://openproblemgarden.org/op/characterizing_aleph_0_aleph_1_graphs#comment</comments>
 <pubDate>Thu, 26 Jun 2008 15:07:31 +0200</pubDate>
 <dc:creator>mdevos</dc:creator>
 <guid isPermaLink="false">1750 at http://openproblemgarden.org</guid>
</item>
</channel>
</rss>
