<?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"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: The random graph, 1</title>
	<atom:link href="http://cameroncounts.wordpress.com/2010/07/09/the-random-graph-1/feed/" rel="self" type="application/rss+xml" />
	<link>http://cameroncounts.wordpress.com/2010/07/09/the-random-graph-1/</link>
	<description>always busy counting, doubting every figured guess . . .</description>
	<lastBuildDate>Tue, 18 Jun 2013 17:33:51 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Peter Cameron</title>
		<link>http://cameroncounts.wordpress.com/2010/07/09/the-random-graph-1/#comment-6396</link>
		<dc:creator><![CDATA[Peter Cameron]]></dc:creator>
		<pubDate>Fri, 17 Aug 2012 09:29:11 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=673#comment-6396</guid>
		<description><![CDATA[Let me answer the second question first. If z is always outside U and V, then there are infinitely many z that work (since having found any. finite number we can add them to U and find another one), so we can always avoid any finite number of previously chosen vertices.

As to the first question, it is easiest just to assume that z is outside both U and V. Certainly it will automatically be outside U because we are considering graphs with no loops. In fact you can prove that even if you don&#039;t assume it&#039;s outside V, there will be a suitable z outside V that works.]]></description>
		<content:encoded><![CDATA[<p>Let me answer the second question first. If z is always outside U and V, then there are infinitely many z that work (since having found any. finite number we can add them to U and find another one), so we can always avoid any finite number of previously chosen vertices.</p>
<p>As to the first question, it is easiest just to assume that z is outside both U and V. Certainly it will automatically be outside U because we are considering graphs with no loops. In fact you can prove that even if you don&#8217;t assume it&#8217;s outside V, there will be a suitable z outside V that works.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rupert</title>
		<link>http://cameroncounts.wordpress.com/2010/07/09/the-random-graph-1/#comment-6384</link>
		<dc:creator><![CDATA[Rupert]]></dc:creator>
		<pubDate>Thu, 16 Aug 2012 14:30:05 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=673#comment-6384</guid>
		<description><![CDATA[In the definition of &quot;correctly joined&quot;, does z have to lie outside of U and V? Or is it somehow automatic that this can always be done? 

I&#039;m wondering why the image you find for a_{n+1} in the proof that a graph satisfying (*) is universal is guaranteed to not be among the preceding a_i&#039;s.]]></description>
		<content:encoded><![CDATA[<p>In the definition of &#8220;correctly joined&#8221;, does z have to lie outside of U and V? Or is it somehow automatic that this can always be done? </p>
<p>I&#8217;m wondering why the image you find for a_{n+1} in the proof that a graph satisfying (*) is universal is guaranteed to not be among the preceding a_i&#8217;s.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The random graph, 2 &#171; Peter Cameron&#039;s Blog</title>
		<link>http://cameroncounts.wordpress.com/2010/07/09/the-random-graph-1/#comment-1501</link>
		<dc:creator><![CDATA[The random graph, 2 &#171; Peter Cameron&#039;s Blog]]></dc:creator>
		<pubDate>Mon, 08 Nov 2010 10:50:02 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=673#comment-1501</guid>
		<description><![CDATA[[...] Previous &#124; Next [...]]]></description>
		<content:encoded><![CDATA[<p>[...] Previous | Next [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Almost all &#171; Peter Cameron&#039;s Blog</title>
		<link>http://cameroncounts.wordpress.com/2010/07/09/the-random-graph-1/#comment-1499</link>
		<dc:creator><![CDATA[Almost all &#171; Peter Cameron&#039;s Blog]]></dc:creator>
		<pubDate>Mon, 08 Nov 2010 10:47:15 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=673#comment-1499</guid>
		<description><![CDATA[[...]  Next [...]]]></description>
		<content:encoded><![CDATA[<p>[...]  Next [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter Cameron</title>
		<link>http://cameroncounts.wordpress.com/2010/07/09/the-random-graph-1/#comment-1264</link>
		<dc:creator><![CDATA[Peter Cameron]]></dc:creator>
		<pubDate>Tue, 14 Sep 2010 09:21:29 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=673#comment-1264</guid>
		<description><![CDATA[Not sure whether this helps with the intuition, but the more symmetry an object has, the fewer different ways you can draw it, and so the fewer copies there are lying around for the random search to find.]]></description>
		<content:encoded><![CDATA[<p>Not sure whether this helps with the intuition, but the more symmetry an object has, the fewer different ways you can draw it, and so the fewer copies there are lying around for the random search to find.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jason Orendorff</title>
		<link>http://cameroncounts.wordpress.com/2010/07/09/the-random-graph-1/#comment-1262</link>
		<dc:creator><![CDATA[Jason Orendorff]]></dc:creator>
		<pubDate>Mon, 13 Sep 2010 23:03:50 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=673#comment-1262</guid>
		<description><![CDATA[Never mind -- inversely proportional is right. For some reason I can&#039;t put my finger on, I find this strangely counterintuitive.]]></description>
		<content:encoded><![CDATA[<p>Never mind &#8212; inversely proportional is right. For some reason I can&#8217;t put my finger on, I find this strangely counterintuitive.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jason Orendorff</title>
		<link>http://cameroncounts.wordpress.com/2010/07/09/the-random-graph-1/#comment-1261</link>
		<dc:creator><![CDATA[Jason Orendorff]]></dc:creator>
		<pubDate>Mon, 13 Sep 2010 22:58:04 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=673#comment-1261</guid>
		<description><![CDATA[&quot;the probability of a graph is inversely proportional to its symmetry (the order of its automorphism group)&quot;

proportional, not inversely proportional, right?

(I think this is great! Thanks for the post; it&#039;ll take me weeks of spare moments to unpack it...)]]></description>
		<content:encoded><![CDATA[<p>&#8220;the probability of a graph is inversely proportional to its symmetry (the order of its automorphism group)&#8221;</p>
<p>proportional, not inversely proportional, right?</p>
<p>(I think this is great! Thanks for the post; it&#8217;ll take me weeks of spare moments to unpack it&#8230;)</p>
]]></content:encoded>
	</item>
</channel>
</rss>
