Ramsey theory
https://plus.maths.org/content/taxonomy/term/444
enOrder in disorder
https://plus.maths.org/content/order-disorder
<p>Can we always find order in systems that are disordered? If so, just how large does a system have to be to contain a certain amount of order? In this video <a href="https://www.dpmms.cam.ac.uk/~leader/">Imre Leader</a> of the Department of Pure Mathematics and Mathematical Statistics at the University of Cambridge gives an equation free introduction to a fascinating area of maths called <em>Ramsey theory</em>.
</p><p><a href="https://plus.maths.org/content/order-disorder" target="_blank">read more</a></p>https://plus.maths.org/content/order-disorder#commentsRamsey theoryMon, 29 Sep 2014 12:42:40 +0000mf3446194 at https://plus.maths.org/contentToo big to write but not too big for Graham
https://plus.maths.org/content/too-big-write-not-too-big-graham
<div class="field field-type-text field-field-author">
<div class="field-items">
<div class="field-item odd">
Rachel Thomas and Marianne Freiberger </div>
</div>
</div>
<div class="field field-type-filefield field-field-abs-img">
<div class="field-items">
<div class="field-item odd">
<img class="imagefield imagefield-field_abs_img" width="100" height="100" alt="" src="https://plus.maths.org/content/sites/plus.maths.org/files/abstractpics/5/3_sep_2014_-_1711/graham_icon.png?1409760685" /> </div>
</div>
</div>
<div class="field field-type-text field-field-abs-txt">
<div class="field-items">
<div class="field-item odd">
<p>Meet the number that's bigger than the observable Universe!</p>
</div>
</div>
</div>
<p>
Recently, when we were writing our book <a href="http://www.amazon.co.uk/Numericon-Journey-through-Hidden-Numbers/dp/1782061541"><em>Numericon</em></a>, we came across what has now become one of our very favourite numbers: <em>Graham's number</em>. One of the reasons we love it is that this number is big. Actually, that's an understatement. Graham's number is mind-bendingly huge.
</p><p><a href="https://plus.maths.org/content/too-big-write-not-too-big-graham" target="_blank">read more</a></p>https://plus.maths.org/content/too-big-write-not-too-big-graham#commentsgraphnetworkRamsey numberRamsey theoryThu, 04 Sep 2014 07:39:12 +0000Rachel6180 at https://plus.maths.org/contentFriends and strangers
https://plus.maths.org/content/friends-and-strangers-0
<div class="field field-type-text field-field-author">
<div class="field-items">
<div class="field-item odd">
Imre Leader </div>
</div>
</div>
<div class="field field-type-filefield field-field-abs-img">
<div class="field-items">
<div class="field-item odd">
<img class="imagefield imagefield-field_abs_img" width="100" height="100" alt="" src="https://plus.maths.org/content/sites/plus.maths.org/files/abstractpics/4/12_mar_2014_-_1457/icon.jpg?1394636245" /> </div>
</div>
</div>
<div class="field field-type-text field-field-abs-txt">
<div class="field-items">
<div class="field-item odd">
<p>Can we always find order in systems that are disordered? If so, just how large does a system have to be to contain a certain amount of order?</p>
</div>
</div>
</div>
<p>
Can we always find order in systems that are disordered? If so, just how
large does a system have to be to contain a certain amount of order?
</p><p>
Let's consider a concrete example. Suppose there is a
room with six people in it. We are interested in whether
people in this room know each other or not. Let's call two
people friends if they know each other, strangers if they
don't.
</p><p><a href="https://plus.maths.org/content/friends-and-strangers-0" target="_blank">read more</a></p>https://plus.maths.org/content/friends-and-strangers-0#commentscombinatoricscreativitygraph theoryRamsey theoryThu, 27 Mar 2014 15:01:00 +0000Rachel6062 at https://plus.maths.org/contentMathematical mysteries: Painting the Plane
https://plus.maths.org/content/mathematical-mysteries-painting-plane
<div class="field field-type-text field-field-author">
<div class="field-items">
<div class="field-item odd">
Helen Joyce </div>
</div>
</div>
<div class="field field-type-text field-field-abs-txt">
<div class="field-items">
<div class="field-item odd">
<p>Suppose you have an infinitely large sheet of paper (mathematicians refer to this hypothetical object as the plane). You also have a number of different colours - pots of paint, perhaps. Your aim is to colour every point on the plane using the colours available. That is, each point must be assigned one colour.</p>
</div>
</div>
</div>
<div class="pub_date">May 2001</div>
<!-- plusimport -->
<p>Suppose you have an infinitely large sheet of paper (mathematicians refer to this hypothetical object as the <i>plane</i>). You also have a number of different colours - pots of paint, perhaps. Your aim is to colour every point on the plane using the colours available. That is, each point must be assigned one colour.</p>
<p>Can you do this so that, for any two points on the plane which are exactly 1cm apart, they are given different colours?</p><p><a href="https://plus.maths.org/content/mathematical-mysteries-painting-plane" target="_blank">read more</a></p>https://plus.maths.org/content/mathematical-mysteries-painting-plane#comments15Mathematical mysteriesplane colouringRamsey theoryMon, 30 Apr 2001 23:00:00 +0000plusadmin4750 at https://plus.maths.org/contentFriends and strangers
https://plus.maths.org/content/friends-and-strangers
<div class="field field-type-text field-field-author">
<div class="field-items">
<div class="field-item odd">
Imre Leader </div>
</div>
</div>
<div class="field field-type-filefield field-field-abs-img">
<div class="field-items">
<div class="field-item odd">
<img class="imagefield imagefield-field_abs_img" width="130" height="130" alt="" src="https://plus.maths.org/content/sites/plus.maths.org/files/issue16/features/ramsey/icon.jpg?975628800" /> </div>
</div>
</div>
<div class="field field-type-text field-field-abs-txt">
<div class="field-items">
<div class="field-item odd">
Sometimes a mathematical object can be so big that, however disorderly we make the object, areas of order are bound to emerge. <b>Imre Leader</b> looks at the colourful world of Ramsey Theory. </div>
</div>
</div>
<div class="pub_date">Sep 2001</div>
<!-- plusimport -->
<br clear="all" />
<p>In 1928, <a href="http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Ramsey.html">Frank Ramsey</a> was wrestling with a problem in mathematical logic. To solve it, it seemed to him, he needed to show that the mathematical systems he was studying would always have a certain amount of order in them.<p><a href="https://plus.maths.org/content/friends-and-strangers" target="_blank">read more</a></p>https://plus.maths.org/content/friends-and-strangers#comments16chaoscolouringgraph theoryRamsey numberRamsey theoryFri, 01 Dec 2000 00:00:00 +0000plusadmin2190 at https://plus.maths.org/content