<?xml version="1.0" encoding="utf-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: A do-it-yourself random graph result</title>
	<atom:link href="http://www.tangentspace.net/cz/archives/2008/05/a-do-it-yourself-random-graph-result/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.tangentspace.net/cz/archives/2008/05/a-do-it-yourself-random-graph-result/</link>
	<description>somewhere near the beginning.</description>
	<pubDate>Fri, 21 Nov 2008 18:00:09 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5</generator>
		<item>
		<title>By: Alex</title>
		<link>http://www.tangentspace.net/cz/archives/2008/05/a-do-it-yourself-random-graph-result/#comment-350006</link>
		<dc:creator>Alex</dc:creator>
		<pubDate>Thu, 22 May 2008 19:06:53 +0000</pubDate>
		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=903#comment-350006</guid>
		<description>As Mike pointed out [tex] P_s(Q) &gt;= 1 [/tex] doesn't make sense, so I don't think the interpretation of the result is that straightforward.</description>
		<content:encoded><![CDATA[<p>As Mike pointed out <img src='/cz/latexrender/pictures/9fe3067f504852567844c0eb0e6c6cfc.png' title=' P_s(Q) &gt;= 1 ' alt=' P_s(Q) &gt;= 1 ' align='middle'/> doesn&#8217;t make sense, so I don&#8217;t think the interpretation of the result is that straightforward.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Stephen</title>
		<link>http://www.tangentspace.net/cz/archives/2008/05/a-do-it-yourself-random-graph-result/#comment-349368</link>
		<dc:creator>Stephen</dc:creator>
		<pubDate>Thu, 22 May 2008 00:32:44 +0000</pubDate>
		<guid isPermaLink="false">http://www.tangentspace.net/cz/?p=903#comment-349368</guid>
		<description>I agree: at some point, s is sufficiently large to guarantee P_s(Q) &#62;= 1.  But to be relevant, you still have to show that this is better than the trivial bound (e.g. s = (n+1)*n/2 ), right?</description>
		<content:encoded><![CDATA[<p>I agree: at some point, s is sufficiently large to guarantee P_s(Q) &gt;= 1.  But to be relevant, you still have to show that this is better than the trivial bound (e.g. s = (n+1)*n/2 ), right?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
