<?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 - The Crossing Number of the Hypercube - Comments</title>
 <link>http://openproblemgarden.org/op/the_crossing_number_of_the_hypercube</link>
 <description>Comments for &quot;The Crossing Number of the Hypercube&quot;</description>
 <language>en</language>
<item>
 <title>Improved upper bound  (re: The Crossing Number of the Hypercube)</title>
 <link>http://openproblemgarden.org/op/the_crossing_number_of_the_hypercube#comment-951</link>
 <description>&lt;p&gt;I came accross a paper &lt;a href=&quot;http://dx.doi.org/10.1002/jgt.20330&quot;&gt;Faria, Herrera de Figueiredo, Sykora, Vrto: An improved upper bound on the crossing number of the hypercube&lt;/a&gt;  that proves half of this, getting the correct upper bound.&lt;/p&gt;
</description>
 <pubDate>Fri, 18 Jul 2008 16:46:21 +0200</pubDate>
 <dc:creator>Robert Samal</dc:creator>
 <guid isPermaLink="false">comment 951 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>The Crossing Number of the Hypercube</title>
 <link>http://openproblemgarden.org/op/the_crossing_number_of_the_hypercube</link>
 <description>&lt;table cellspacing=&quot;10&quot;&gt;
&lt;tr&gt;
  &lt;td&gt;
    Author(s):
        &lt;a href=&quot;/category/erdos&quot;&gt;Erdos&lt;/a&gt;; &lt;a href=&quot;/category/guy_richard_k&quot;&gt;Guy&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/topological_graph_theory&quot;&gt;Topological G.T.&lt;/a&gt; » &lt;a href=&quot;/category/crossing_numbers&quot;&gt;Crossing numbers&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;The crossing number &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/1c88c74b39c3c8b388e8af0eb6b815eaa7a993c3.png&quot; alt=&quot;$ cr(G) $&quot; /&gt; of &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt; is the minimum number  of crossings in all drawings of &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt; in the plane.&lt;/p&gt;
&lt;p&gt;The &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/aeba4a4076fc495e8b5df04d874f2911a838883a.png&quot; alt=&quot;$ d $&quot; /&gt;-dimensional (hyper)cube &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/285c5204273d3b499eea40b8b9ea3d2a2f1be0f8.png&quot; alt=&quot;$ Q_d $&quot; /&gt; is the graph whose  vertices are all binary sequences of length &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/aeba4a4076fc495e8b5df04d874f2911a838883a.png&quot; alt=&quot;$ d $&quot; /&gt;, and two  of the sequences are adjacent in &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/285c5204273d3b499eea40b8b9ea3d2a2f1be0f8.png&quot; alt=&quot;$ Q_d $&quot; /&gt; if they differ in precisely  one coordinate.&lt;/p&gt;
&lt;div class=&quot;envtheorem&quot;&gt;&lt;b&gt;Conjecture&lt;/b&gt;&amp;nbsp;&amp;nbsp; &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/8a347f2f5bc9527051396b3f7efcdc793f5c87f0.png&quot; alt=&quot;$ \displaystyle \lim  \frac{cr(Q_d)}{4^d} = \frac{5}{32} $&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/erdos">Erdos, Paul</category>
 <category domain="http://openproblemgarden.org/category/guy_richard_k">Guy, Richard K.</category>
 <category domain="http://openproblemgarden.org/category/crossing_number">crossing number</category>
 <category domain="http://openproblemgarden.org/category/hypercube">hypercube</category>
 <category domain="http://openproblemgarden.org/category/graph_theory">Graph Theory</category>
 <category domain="http://openproblemgarden.org/category/topological_graph_theory">Topological Graph Theory</category>
 <category domain="http://openproblemgarden.org/category/crossing_numbers">Crossing numbers</category>
 <comments>http://openproblemgarden.org/op/the_crossing_number_of_the_hypercube#comment</comments>
 <pubDate>Fri, 11 May 2007 08:55:03 +0200</pubDate>
 <dc:creator>Robert Samal</dc:creator>
 <guid isPermaLink="false">313 at http://openproblemgarden.org</guid>
</item>
</channel>
</rss>
