This is a sensationalist headline. Ramsey's theorem concerns patterns in a simple system, the coloring of edges in a graph. It says regardless of how the graph is colored you can always find a triangle of vertices with certain properties.

This does not mean complete disorder is impossible. It's just a combinatorial argument that says this simple game of coloring edges on a graph has some patterns to it.

But then maybe you're of the mindset that the universe is a complete graph and physics is a color by number game...in which case....oh god, we're all screwed...

There is an infinite version of Ramsey's theorem.

Suppose you consider the collection of pairs of positive whole numbers, and each pair is colored either red or blue. Then there is an infinite set S of positive whole numbers such that any pair of items from S are the same color.

In symbols:

P = { (a,b) : a in N, b in N }

C : P -> {0,1}

There exists S an infinite subset of N and c in {0,1} such that for all a in S and b in S, C(a,b)=c.

The proof is quite simple, I use it regularly to boggle 13 and 14 year olds.

I don't know if Ramsey's theorem really says anything as grand about disorder as Maxwell's demon and the like, but it does express something quantitative about the existence of subsets containing some specific properties as the size of the graph increases.

For me, Ramsey's theory is particularly interesting its rare that an open problem in mathematics can be explained to anyone with relatively little background in mathematics or logic for that matter. Mathematicians have discovered some bounds on R(n), but an exact solution looks like its no where in sight.

Rainbow Ramsey's theorem shows that complete disorder is unavoidable as well. :)

In other words, when complete disorder is achieved, complete order is formed (since that disorder becomes completly homogeneous).