<?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: Updates</title>
	<atom:link href="http://cameroncounts.wordpress.com/2011/09/28/updates/feed/" rel="self" type="application/rss+xml" />
	<link>http://cameroncounts.wordpress.com/2011/09/28/updates/</link>
	<description>always busy counting, doubting every figured guess . . .</description>
	<lastBuildDate>Sun, 05 May 2013 21:43:35 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Gordon Royle</title>
		<link>http://cameroncounts.wordpress.com/2011/09/28/updates/#comment-3055</link>
		<dc:creator><![CDATA[Gordon Royle]]></dc:creator>
		<pubDate>Sun, 02 Oct 2011 12:16:03 +0000</pubDate>
		<guid isPermaLink="false">http://cameroncounts.wordpress.com/?p=1798#comment-3055</guid>
		<description><![CDATA[Nice article. 

Even though I&#039;ve been in the game less time than you, the respect accorded to combinatorics has increased noticeably even since I started out.  I think that because many combinatorial problems are so easily stated (if not solved) that it is very easy for them to be dismissed by researchers in subjects of such technicality that you need a decade of study merely in order to be able to understand the STATEMENT of the problem, let alone tackle it. 

Your article mentions a few of the factors - in particular, the central role of combinatorial problems in computational complexity and the development of really deep structural theory by Robertson and Seymour.

But I also credit another factor - a vastly increased focus on the concept of an abstract network, driven by the study of real networks in particular the Internet and social networks, and popularised by the &quot;small world&quot; craze of a few years ago (which of course includes genuine research in addition to pop-science).]]></description>
		<content:encoded><![CDATA[<p>Nice article. </p>
<p>Even though I&#8217;ve been in the game less time than you, the respect accorded to combinatorics has increased noticeably even since I started out.  I think that because many combinatorial problems are so easily stated (if not solved) that it is very easy for them to be dismissed by researchers in subjects of such technicality that you need a decade of study merely in order to be able to understand the STATEMENT of the problem, let alone tackle it. </p>
<p>Your article mentions a few of the factors &#8211; in particular, the central role of combinatorial problems in computational complexity and the development of really deep structural theory by Robertson and Seymour.</p>
<p>But I also credit another factor &#8211; a vastly increased focus on the concept of an abstract network, driven by the study of real networks in particular the Internet and social networks, and popularised by the &#8220;small world&#8221; craze of a few years ago (which of course includes genuine research in addition to pop-science).</p>
]]></content:encoded>
	</item>
</channel>
</rss>
