# The Party Problem (Ramsey's Theorem)

(Difference between revisions)
{{!}} colspan=2 {{!}}

[[Image:Proof6.png|175px]] [[Image:Rarrow.png|75px]] [[Image:Proof7.png|175px]]

There is a give and take between the two colors; if you have less than 3 edges of blue, you will have more than 3 edges of red, and vice versa. This means that you will ''always'' have at least 3 edges of blue or 3 edges of red.
To generalize this, if you select any vertex ''x'', it is guaranteed that ''x'' will either lie on ''R''(''M'' - 1, ''N'') edges of ''c''1 or ''R''(''M'', ''N'' - 1) edges of ''c''2. In the former case, the vertices that are connected to ''x'' by edges colored in ''c''1 form a subgraph ''K''''R''(''M'' - 1, ''N''). Now let's look at this subgraph in isolation and repaint it in colors ''c''1 and ''c''2. Because we are assuming that the Ramsey number ''R''(''M'' - 1, ''N'') exists, the subgraph contains either:

- a ''K''''m'' - 1 with edges colored in ''c''1 that, together with the additional vertex ''x'', form a ''K''''m'', or
- a ''K''''n'' whose edges are all colored in ''c''2.

Either way, we have demonstrated that ''K''''R''(''M'' - 1, ''N''), and by extension ''K''v, contain a monochromatic subgraph in either ''c''1 or ''c''2. + - # Therefore, by induction, we have proved that ''R''(''M'',''N'') exists. + - }}By proving the lemma, we have shown that monochromatic subgraphs always exist in a 2-painting of ''K''''v''. In the following proof, we will generalize our results to show that monochromatic subgraphs of any shape exist in any ''k''-painting of ''K''''v''. In other words, a Ramsey Number exists for every complete graph, regardless of the number of colors in which the graph is painted. + + Say we have a graph ''K''v painted in ''c''1 and ''c''2 colors, where ''v'' ≥ ''R''(''M'' - 1, ''N'') + ''R''(''M'', ''N'' - 1). To visualize this, think of a simple example: ''K''6. Since it has 6 vertices, let's "split it up" into two graphs with 3 vertices each so that we can model ''v'' ≥ ''R''(''M'' - 1, ''N'') + ''R''(''M'', ''N'' - 1) as ''v'' ≥ 3 + 3: + + [[Image:Proof6.png|175px]] [[Image:Rarrow.png|75px]] [[Image:Proof7.png|175px]] + + + There is a give and take between the two colors; if you have less than 3 edges of blue, you will have more than 3 edges of red, and vice versa. This means that you will ''always'' have at least 3 edges of blue or 3 edges of red. + + To generalize this, if you select any vertex ''x'', it is guaranteed that ''x'' will either lie on ''R''(''M'' - 1, ''N'') edges of ''c''1 or ''R''(''M'', ''N'' - 1) edges of ''c''2, because we required that ''v'' ≥ ''R''(''M'' - 1, ''N'') + ''R''(''M'', ''N'' - 1). In the former case, the vertices that are connected to ''x'' by edges colored in ''c''1 form a subgraph ''K''''R''(''M'' - 1, ''N''). Now let's look at this subgraph in isolation and repaint it in colors ''c''1 and ''c''2. Because we are assuming that the Ramsey number ''R''(''M'' - 1, ''N'') exists, the subgraph contains either: + + + - a ''K''''M'' - 1 with edges colored in ''c''1 that, together with the additional vertex ''x'', form a ''K''''M'', or + + - a ''K''''N'' whose edges are all colored in ''c''2. + + + Either way, we have demonstrated that ''K''''R''(''M'' - 1, ''N'') contains a monochromatic subgraph in either ''c''1 or ''c''2. Since ''K''''v'' contains ''K''''R''(''M'' - 1, ''N'') as a subgraph, we can extend our result and see that ''K''''v'' also contains a monochromatic subgraph. By induction, we have proved that ''R''(''M'',''N'') exists. + }}By proving the lemma, we have shown that monochromatic, complete subgraphs always exist in a 2-painting of ''K''''v''. In the following proof, we will generalize our results to show that monochromatic subgraphs of any shape exist in any ''k''-painting of ''K''''v''. In other words, a Ramsey Number exists for every complete graph, regardless of the number of colors in which the graph is painted. + + + '''Ramsey's Theorem:''' ''G''1, ''G''2, …, ''G''''k'', are any ''k'' graphs. There exists an integer ''R''(''G''1, ''G''2, …, ''G''''k'') such that, when ''v'' ≥ ''R''(''G''1, ''G''2, …, ''G''''k''), a ''k''-painting of ''K''''v'' must contain a subgraph that is isomorphic to ''G''''i'' and monochromatic in color ''i'', for some ''i'' where 1 ≤ ''i'' ≤ ''k''.Wallis, W. D. A Beginner's Guide to Graph Theory. Boston: Birkhäuser, 2000. {{SwitchPreview|ShowMessage=2 - Proof of Ramsey's Theorem|HideMessage=Click to hide|PreviewText= |FullText= {{SwitchPreview|ShowMessage=2 - Proof of Ramsey's Theorem|HideMessage=Click to hide|PreviewText= |FullText= - '''Theorem:''' ''G''1, ''G''2, …, ''G''''k'', are any ''k'' graphs. There exists an integer ''R''(''G''1, ''G''2, …, ''G''''k'') such that, when ''v'' ≥ ''R''(''G''1, ''G''2, …, ''G''''k''), a ''k''-painting of ''K''''v'' must contain a subgraph that is isomorphic to ''G''''i'' and monochromatic in color ''i'', where 1 ≤ ''i'' ≤ ''k''. - A word on notation: + Let's break this theorem down into an identical but simpler statement. Say you have an arbitrary number of graphs (''G''1, ''G''2, …, ''G''''k'' ). If you have a complete graph (''K''''v'' ) that meets certain specifications, and you paint it with ''k'' colors, you are guaranteed to have monochromatic subgraphs within ''K''''v'' that are identical to the arbitrary graphs you started with. The specifications for the complete graph are that it must have a number of vertices greater than or equal to the Ramsey number (''R''(''G''1, ''G''2, …, ''G''''k'') ). The theorem states that such a Ramsey number always exists, no matter what arbitrary graphs and colors you pick. - * ''R''(''G''1, ''G''2, ..., ''G''''k'') are Ramsey Numbers. + - * If all the graphs are complete graphs, i.e. ''G''''1'' = ''K''''p''1, ''G''''2'' = ''K''''p''2, ..., ''G''''k'' = ''K''''p''''k'' , then ''R''(''K''''p''1, ''K''''p''2, ..., ''K''''p''''k'') is rewritten as ''R''(''p''1, ''p''2, ..., ''p''''k''). + - * The number of vertices in ''G''''i'' is denoted as ''v''(''G''''i''). + - '''Proof:''' It is sufficient to prove this theorem for the case in which all ''G''''i'' are complete graphs. To see this, say that ''v'' is large enough that a ''k''-painted ''K''''v'' contains a monochromatic ''K''''v''(''G''''i'') in color ''c''''i''. Since the number of edges in ''K''''v''(''G''''i'') is greater or equal to the number of edges in ''G''''i'', it necessarily follows that ''K''''v'' also contains a monochromatic ''G''''i'' in color ''c''''i''. In other words: + :This builds upon the lemma we just proved, which had limited results: + ::'''Point 1:''' We showed that a Ramsey number ''R''(''G''1, ''G''2) always exists. We only proved this for when the ''G''1 and ''G''2 are complete graphs. + ::'''Point 2:''' We tested for only 2 colors, ''c''''i'', for some ''i'' where ''i'' = 1 or 2. + :As you saw in the theorem's statement, we will now expand on both of these points. We will see that the graphs ''G''k do not have to be complete, and that we can color a sufficiently large ''K''''v'' with more than 2 colors and still find monochromatic subgraphs. - :[itex]R(v(G_1), v(G_2), ..., v(G_k)) \ge R(G_1, G_2, ..., G_k)[/itex] + A word on notation before we start: + :* The number of vertices in ''G''''i'' is denoted as ''v''(''G''''i''). + :* The notation ''G''''k'' does not necessarily mean that the graph ''G'' has ''k'' vertices. It can be any graph. Instead, we use ''v''(''G''''k'') to indicate the size of the monochromatic subgraph we are looking for, just as ''R''(3,3) meant that we were looking for a monochromatic, complete subgraph with 3 vertices. + :* If all the graphs are complete graphs, i.e. ''G''''1'' = ''K''''p''1, ''G''''2'' = ''K''''p''2, ..., ''G''''k'' = ''K''''p''''k'' , then ''R''(''K''''p''1, ''K''''p''2, ..., ''K''''p''''k'') is rewritten as ''R''(''p''1, ''p''2, ..., ''p''''k''). - In order to prove that ''R''(''p''1, ''p''2, ..., ''p''''k'') always exists, we will perform an induction on ''k''. + - # We previously saw the proof for the basic case, ''k'' = 2, in the Lemma. + '''Proof:''' - # Assume that for ''k'' < ''K'', ''R''(''p''1, ''p''2, ..., ''p''''k'') exists. Then if the integers ''p''1, ''p''2, ..., ''p''''K'' are given, ''R''(''p''1, ''p''2, ..., ''p''''K'' - 1) exists. + - # Now suppose that ''v'' ≥ ''R''(''R''(''p''1, ''p''2, ..., ''p''''K''-1), ''p''''K''). Take any ''k''-painting of ''K''''v''. For all edges painted in a color other than ''c''''k'', assign a new color ''c''''l'' to form a 2-painting of ''K''''v'' in ''c''''l'' and ''c''''k''. The repainted graph must now contain either a ''K''''R''(''p''1, ''p''2, ..., ''p''''K''-1) monochromatic in color ''c''''l'' or a ''K''''p''''K'' monochromatic in color ''c''''K''. + ''Expanding Point 1'' - # Take the former subgraph, ''K''''R''(''p''1, ''p''2, ..., ''p''''K''-1), and look at its corresponding subgraph in the original painting (before its edges were recolored to ''c''''l''). It has edges in colors ''c''1, ''c''2, ..., ''c''''K'' - 1 only. Therefore, by induction, it contains a ''K''''p''''i'' monochromatic in color ''c''''i'' for some ''i''. + + ''K''''v''(''G''''i'') is the complete graph that has the same number of vertices as ''G''''i''. Proving the theorem for ''K''''v''(''G''''i'') implies the proof for ''G''''i''. To see why, say that ''v'' is large enough that a ''k''-painted ''K''''v'' contains a monochromatic ''K''''v''(''G''''i'') in color ''c''''i'' : + + {{{!}} + {{!}} [[Image:Proof8.png|200px]] + {{!}} [[Image:Rarrow.png|75px]] + {{!}} [[Image:Proof9.png|200px]] + {{!}} [[Image:Rarrow.png|75px]] + {{!}} [[Image:Proof10.png|200px]] + {{!}}- + {{!}} align="center" {{!}} 3-painted ''K''7.... + {{!}} + {{!}} align="center" {{!}} ...contains blue monochromatic ''K''''v''(''G''''i''). + {{!}} + {{!}} align="center" {{!}} ''K''''v''(''G''''i'') (isomorphic to ''K''5) + {{!}}} + + The number of edges in ''K''''v''(''G''''i'') is greater or equal to the number of edges in ''G''''i'' : + + {{{!}} + {{!}} [[Image:Proof11.png|200px]] + {{!}} [[Image:Rarrow.png|75px]] + {{!}} [[Image:Proof12.png|200px]] + {{!}}- + {{!}} align="center" {{!}} ''K''''v''(''G''''i'')... + {{!}} + {{!}} align="center" {{!}} ...contains ''G''''i'' + {{!}}} + + It necessarily follows that if ''K''''v'' contains a monochromatic ''K''''v''(''G''''i'') in color ''c''''i'', it will also contain a monochromatic ''G''''i'' in the same color. In other words: + + :[itex]R(K_{v(G_1)}, K_{v(G_2)}, ..., K_{v(G_k)}) \ge R(G_1, G_2, ..., G_k)[/itex] + + This is why it is sufficient to prove this theorem for the case in which all ''G''''i'' are complete graphs. + + + ''Expanding Point 2'' + + In order to prove that ''R''(''p''1, ''p''2, ..., ''p''''k'') always exists, we will perform an induction on ''k''. + + We previously saw the proof for the basic case, ''k'' = 2, in the Lemma. Now assume that for ''k'' < ''Q'', ''R''(''p''1, ''p''2, ..., ''p''''k'') exists. Then if the integers ''p''1, ''p''2, ..., ''p''''Q'' are given, ''R''(''p''1, ''p''2, ..., ''p''''Q'' - 1) exists. + + Let's take the graph ''K''''v'', where ''v'' ≥ ''R'' ( ''R''(''p''1, ''p''2, ..., ''p''''Q'' - 1), ''p''''Q'' ). We know that the Ramsey number ''R'' ( ''R''(''p''1, ''p''2, ..., ''p''''Q'' - 1), ''p''''Q'' ) exists, due to the lemma we proved before, and we already assumed that ''R''(''p''1, ''p''2, ..., ''p''''Q'' - 1) exists in the previous step. Remember that ''R''(''p''1, ''p''2, ..., ''p''''Q'' - 1) is the minimum number of vertices a complete graph (let's call it ''K''''P'') must have to contain the monochromatic subgraphs ''K''''p''1, ''K''''p''2, ..., ''K''''p''''Q'' - 1. This means that ''R'' ( ''R''(''p''1, ''p''2, ..., ''p''''Q'' - 1), ''p''''Q'' ) is the minimum number of vertices a complete graph must have to contain either a monochromatic ''K''''P'' or a monochromatic ''K''''Q''. + + Now take this ''K''''v'' and paint it in any ''k'' colors. Here's the induction step: let's say that ''k'' = ''Q''. + + For all edges painted in a color other than ''c''''k'', temporarily assign a new color ''c''''m''. This creates a 2-painting, which we already know how to analyze! The repainted graph must contain either a ''K''''R''(''p''1, ''p''2, ..., ''p''''Q'' - 1) monochromatic subgraph in color ''c''''m'' or a ''K''''p''''Q'' monochromatic subgraph in color ''c''''Q''. + + Take the former subgraph, ''K''''R''(''p''1, ''p''2, ..., ''p''''Q'' - 1), and look at it in the original painting (before its edges were recolored to ''c''''m''). It has edges in colors ''c''1, ''c''2, ..., ''c''''Q'' - 1 only. Therefore, by induction, it contains a monochromatic ''K''''p''''i'' painted in color ''c''''i'' for some ''i''. + + This shows that a Ramsey number ''R''(''p''1, ''p''2, …, ''p''''k'') always exists. When a ''k''-painting of ''K''''v'' has a number of vertices greater or equal to this Ramsey number, it must contain a monochromatic ''K''''p''''i'' subgraph in color ''i'', for some ''i'' where 1 ≤ ''i'' ≤ ''k''. }} }} ===Ramsey Numbers=== ===Ramsey Numbers=== Line 197: Line 275: |SiteURL=http://www.mathforum.org/mathimages/index.php/User:Aahn1 Author's user page |SiteURL=http://www.mathforum.org/mathimages/index.php/User:Aahn1 Author's user page |Field=Graph Theory |Field=Graph Theory - |WhyInteresting='''Impossibility of Disorder''' + |WhyInteresting=[[Image:Complicated_graph.jpg|right|thumb|Example of how complicated these graphs can get (retrieved from [http://www.isgtw.org/visualization/isgtw-image-week-internet-space isgtw.org])]] + ===Impossibility of Disorder=== + + Total disorder in a graph is impossible. To extend the party metaphor, imagine that you invite more than 6 people. Regardless of how many people you invite, there will always be at least 3 people who are mutual acquaintances or acquaintances. + + Take any infinite graph you'd like. If you color it with an arbitrary, finite number of colors, there will always exist monochromatic subgraphs. So no matter how you color the graph, there will always be pockets of order. - The party problem is a simple example of Ramsey's Theorem, which states that total disorder in a graph is impossible. To extend the party metaphor, imagine that you invite more than 6 people. Regardless of how many people you invite, there will always be at least 3 people who are mutual friends or acquaintances. + ''There will always be an island of order in random, infinite chaos.'' Sounds quite poetic, right? - More formally: Regardless of the size of a system, if it is partitioned arbitrarily into subsystems, at least one subsystem will have a particular property that is shared by its constituents (monochromaticism, for example). This ensures that total disorder is impossible. + More generally: Regardless of the size of a system, if it's partitioned arbitrarily into subsystems, at least one subsystem will have a property that is shared by its constituents (monochromaticism, for example). - |References=Ryser, Hervert John. The Carus Mathematical Monographs: Combinatorial Mathematics. Vol. Fourteen. Rahway: Quinn & Boden Company, Inc., 1963. + |References= - Wallis, W. D. A Beginner's Guide to Graph Theory. Boston: Birkhäuser, 2000. + Ryser, Hervert John. The Carus Mathematical Monographs: Combinatorial Mathematics. Vol. Fourteen. Rahway: Quinn & Boden Company, Inc., 1963. Caldwell, Chris. "Graph Theory Glossary." Graph Theory Glossary. 19 June 2012 . Caldwell, Chris. "Graph Theory Glossary." Graph Theory Glossary. 19 June 2012 .

## Current revision

The Party Problem
Field: Graph Theory
Image Created By: Awjin Ahn
Website: Author's user page

The Party Problem

You're going to throw a party, but haven't yet decided whom to invite. How many people do you need to invite to guarantee that at least m people will all know each other, or at least n people will all not know each other?

# Basic Description

Imagine that the next party you throw is, in secret, a mathematical experiment to find a solution to the party problem. Exhausted after planning, cooking, and setting up, you fall onto the couch and have some downtime to analyze the situation. Here is the question you want to answer:

How many people do you need to invite to make sure that at least 3 people will be mutual acquaintances, or at least 3 people will be mutual strangers? Because you have limited food, you want to find the lowest number of people you can invite while still satisfying these conditions.

### Trivial Case

Note: From here on out,

• blue edges will connect two vertices to represent that the people are mutual acquaintances
• red, dashed edges will connect two vertices to represent that the people are mutual strangers

 Fig. 1a In the case of 2 people, Adam and Ben, they can either know each other or not. Therefore, there is only one edge between them, indicating that they are either acquaintances or strangers (Fig. 1a and 1b). Furthermore, since there are only 2 people, we cannot fulfill the minimum requirement of at least 3 people that are mutual acquaintances or strangers. Fig. 1b

### Nontrivial Cases

 Fig. 2a When you invite a third person, Cam, you can form a set of 3 people. Let's say, for the sake of argument, that they all know each other (Fig. 2a), thereby satisfying the conditions of the party problem. Note that in Fig. 2a, the edges that connect the 3 vertices form a triangle with edges of the same color. This kind of triangle, called a monochromatic triangle, indicates that the 3 people represented by the vertices are either all mutual acquaintances or mutual strangers. It appears that 3 people is the answer to the party problem; inviting 3 people allows you to form a set of 3 people that all know each other. However, you could also think of a case in which Adam and Ben know each other, but don't know Cam (Fig. 2b). If that is the case, you can't form a set of 3 people that are either acquaintances or strangers. This is a good illustration of a counterexample to our claim that 3 people were enough to solve the party problem. We need to invite more than 3 people. In the next two cases, we will again use counterexamples to show that inviting 4 or 5 people is still not enough. Fig. 2b

 Fig. 3 Your fourth guest is Dina. Let's use the same counterexample strategy we used for 3 people. Assume that 4 is a solution to the party problem. In order to find a counterexample to our assumption, we have to find a configuration such that there exist no red or blue monochromatic triangles. Such a configuration is shown in Fig. 3. The outer edges are colored blue, and the inner edges (the diagonals of the square) are colored red. There is no way that you could make a monochromatic triangle from the blue outer edges, or from the red inner edges. In other words, you can't form a set of 3 people that are all mutual acquaintances or mutual strangers. We have found a counterexample, and therefore 4 is not an answer to the party problem. When you invite Elsa, the fifth guest, again assume that 5 people is an answer to the party problem. Let's use the same coloring strategy that we used for 4 people. As shown in Fig. 4, color the outer edges blue and the inner edges red. You still can't form a monochromatic triangle from either the blue outer edges or the red inner edges. Fig. 4 is a counterexample to our assumption, and therefore 5 people is not an answer. Fig. 4

### A More Complicated Case

Until now, it has been relatively easy to come up with counterexamples to prove that 3, 4, or 5 people are not enough to guarantee that at least 3 people will be mutual acquaintances or strangers. When you invite a sixth person, Fiona, it becomes a little more complicated. We can think of various cases in which 6 seems to be an answer. In the following cases, there is always a monochromatic triangle:

 To find a configuration that will not form a monochromatic triangle, try using the coloring strategy that we used for 4 and 5 people. In other words, color the outer edges blue and the inner edges red. Does this work? Nope. This configuration still contains red, monochromatic triangles.

 Just because there are many configurations that suggest 6 is the answer, however, doesn't prove that it is. We have to apply a more general proof to show that, no matter what, in any set of 6 people, 3 people will be mutual friends or mutual strangers. To do this, we will try to find a configuration that does not produce any monochromatic triangles, and then realize it is impossible to do so. First, let's reconfigure the vertices so that the problem is easier to model—we will only draw the edges that originate at vertex A (see left). To begin with, let's assume that all of these edges are blue. Later on, we'll see that it doesn't matter what color these edges are. Remember that we are trying to find a configuration that does not produce any monochromatic triangles. Look at the triangle that would be formed by vertices A, B, and C. Since edges AB and AC are blue, we would have to make BC red to prevent triangle ABC from becoming monochromatic. Likewise, in triangle ACD, since edges AC and AD are blue, edge CD must be red. Now, look at the triangle that would be formed by vertices A, B, and D. Since edges AB and AD are blue, edge BD must be red to avoid a monochromatic triangle. Even though we avoided creating a blue monochromatic triangle, we are eventually forced to form a red monochromatic triangle that has the vertices B, C, and D. This holds true even if we change our initial assumption that all the edges emanating from A are blue. If edge AE were red, edge AF were red, or both edges AE and AF were red, our end results would not change. This is because these are trivial changes to the configuration. We didn't use or consider edges AE and AF when we formed the monochromatic triangle BCD, so changing their colors has no effect on triangle BCD. Now what about nontrivial changes to the configuration? Say we change edge AD from blue to red. If AD isn't blue, we can no longer put a constraint on edge CD—it can be either red or blue. It is no longer guaranteed that triangle BCD is monochromatic. Let's look at this new configuration again. Edges AC and AF are blue, so edge CF must be red to prevent triangle ACF from becoming a blue monochromatic triangle. Edges AB and AF are blue, so edge BF must be red to prevent triangle ABF from becoming blue and monochromatic. Sound familiar? We are, once again, forced to form a red monochromatic triangle (triangle BCF). Even if we make a nontrivial change to the configuration and change edge AC from blue to red, we are still forced to form the red monochromatic triangle BEF.

 Because we failed to find any case in which there exists no monochromatic triangle, we have proven that 6 vertices is a solution to the party problem for the following configurations: 5 blue and 0 red edges, 4 blue and 1 red edge, and 3 blue and 2 red edges. What about the other configurations? The remaining configurations are (0 blue, 5 red), (1 blue, 4 red), and (2 blue, 3 red). We can obtain the diagrams for these configurations by simply flipping the colors in the three proven configurations. For example, when the blue is replaced with red and vice-versa, the diagram for (5 blue, 0 red) becomes the diagram for (0 blue, 5 red). (5 blue, 0 red) & (0 blue, 5 red) (4 blue, 1 red) & (1 blue, 4 red) (3 blue, 2 red) & (2 blue, 3 red) Since we have demonstrated that any configuration of 6 people will always contain a monochromatic triangle, our results can be generalized to all cases.

Finally, we've arrived at an answer to the party problem: To guarantee that at least 3 people will be mutual acquaintances or mutual strangers, you must invite a minimum of 6 people to the party.

# A More Mathematical Explanation

Note: understanding of this explanation requires: *Graph Theory

The answer we just found is called a Ramsey number. In the simplistic terms of the party proble [...]

The answer we just found is called a Ramsey number. In the simplistic terms of the party problem, a Ramsey number R(m,n) is the minimum number of people you must invite so that at least m people will be mutual friends or at least n people will be mutual strangers. In the previous case, we proved that 6 is the Ramsey number when you want at least 3 people to be either mutual acquaintances or mutual strangers. In other words, R(3,3) = 6.

 A complete graph with 6 vertices (v = 6). Monochromatic subgraphs with 3 vertices will always exist in this graph. So how does the party problem connect to graph theory? The transition from parties to graphs is simple—in fact, we've been modeling the invited people as the vertices of a graph already. We figured out earlier that the graph must have at least 6 vertices to guarantee that either a blue, monochromatic, complete subgraph with 3 vertices or a red, monochromatic, complete subgraph with 3 vertices exists. The constraint on the number of vertices v is denoted as follows: $v \ge R(3,3)$. Since R(3,3) = 6, we can be specific and say that v ≥ 6. A complete graph with 7 vertices (v = 7). Since 7 ≥ R(3,3), monochromatic subgraphs with 3 vertices will always exist in this graph as well. This can be taken even further and applied to any complete graph. Say you pick 2 colors, c1 and c2, and paint a graph with those colors (we previously picked blue and red). The Ramsey number is the minimum number of vertices that that graph must have to ensure that there exists either a c1-colored monochromatic, complete subgraph with at least m vertices or a c2-colored monochromatic, complete subgraph with at least n vertices: $v \ge R(m,n)$. As we will see later on, there is a Ramsey number for all complete graphs—there exists an R(3,4), R(4,4), etc. Subgraph H of graph K6 To put it in more formal terms, take a complete graph K with v vertices that has its edges painted in k colors. We call this a k-painting of Kv. A subgraph H of K is monochromatic if all its edges are painted with the same color. Therefore, our previous results can be expanded as follows: A 2-painting of K6 must contain monochromatic K3 subgraphs. Monochromatic K3

## Ramsey's Theorem

Until now, we have only considered painting graphs with 2 colors. What if we paint a graph with more than 2 colors? Can we still guarantee that monochromatic, complete subgraphs will exist in a 3-painting of a graph? In a 4-painting? The short answer is yes. Ramsey's Theorem, which generalizes the notion of Ramsey numbers, states that if you take a sufficiently large graph and paint it in any k colors, there must always exist monochromatic, complete subgraphs.

### Graphical Proof

First, let's look at the case for painting with 2 colors. We previously demonstrated that R(3,3) exists. We will now prove that any R(m,n) always exists.

Lemma for Painting a Graph with 2 Colors: An integer R(m,n) exists such that any painting of KR(m,n) in 2 colors c1 and c2 contains either a Km with all its edges in c1 or a Kn with all its edges in c2.[1]

You might have noticed a new term, KR(m,n), in the lemma statement. This is simply notation for a complete graph Kv that is large enough so that it has v = R(m,n) vertices. Since KR(m,n) has a number of vertices equal to the Ramsey number R(m,n), it is guaranteed to have a complete subgraph with m vertices painted in c1 or n vertices painted in c2.

So for example, as we saw before, R(3,3) ≥ 6. That means that $K_{R(m,n)} = K_{R(3,3)} = K_6$. (Or K7. Or any Kv where v ≥ 6, really.)

Now, we have to prove that this R(m,n) exists for every m and n, not just m = n = 3.

Proof: We need to find the base case so that we can perform induction on it. Remember the first, trivial case that we covered in the basic description? All we need to do this start from this case, because it is the most basic.

 In K2 (Fig. 5), there are 2 possible configurations. The two vertices are connected by either a c1-colored edge or a c2-colored edge. Notice that there will always be either a monochromatic c1-colored subgraph with 2 vertices, or a monochromatic c2-colored subgraph with 2 vertices. Therefore, the Ramsey number for the base case exists, and is R(2,2) = 2. Fig. 5

R(2,2) is our base case, where m = n = 2. We will perform induction on m + n = 4.

As we just demonstrated, the Lemma holds for the base case, when m + n = 4. Assume that the Lemma is true when m + n < Q. Now take two positive integers M and N that add up to Q. If M + N = Q, then M + N - 1 < Q. Therefore, both R(M - 1, N) and R(M, N - 1) exist.

Say we have a graph Kv painted in c1 and c2 colors, where vR(M - 1, N) + R(M, N - 1). To visualize this, think of a simple example: K6. Since it has 6 vertices, let's "split it up" into two graphs with 3 vertices each so that we can model vR(M - 1, N) + R(M, N - 1) as v ≥ 3 + 3:

There is a give and take between the two colors; if you have less than 3 edges of blue, you will have more than 3 edges of red, and vice versa. This means that you will always have at least 3 edges of blue or 3 edges of red.

To generalize this, if you select any vertex x, it is guaranteed that x will either lie on R(M - 1, N) edges of c1 or R(M, N - 1) edges of c2, because we required that vR(M - 1, N) + R(M, N - 1). In the former case, the vertices that are connected to x by edges colored in c1 form a subgraph KR(M - 1, N). Now let's look at this subgraph in isolation and repaint it in colors c1 and c2. Because we are assuming that the Ramsey number R(M - 1, N) exists, the subgraph contains either:

- a KM - 1 with edges colored in c1 that, together with the additional vertex x, form a KM, or

- a KN whose edges are all colored in c2.

Either way, we have demonstrated that KR(M - 1, N) contains a monochromatic subgraph in either c1 or c2. Since Kv contains KR(M - 1, N) as a subgraph, we can extend our result and see that Kv also contains a monochromatic subgraph. By induction, we have proved that R(M,N) exists.

By proving the lemma, we have shown that monochromatic, complete subgraphs always exist in a 2-painting of Kv. In the following proof, we will generalize our results to show that monochromatic subgraphs of any shape exist in any k-painting of Kv. In other words, a Ramsey Number exists for every complete graph, regardless of the number of colors in which the graph is painted.

Ramsey's Theorem: G1, G2, …, Gk, are any k graphs. There exists an integer R(G1, G2, …, Gk) such that, when vR(G1, G2, …, Gk), a k-painting of Kv must contain a subgraph that is isomorphic to Gi and monochromatic in color i, for some i where 1 ≤ ik.[1]

Let's break this theorem down into an identical but simpler statement. Say you have an arbitrary number of graphs (G1, G2, …, Gk ). If you have a complete graph (Kv ) that meets certain specifications, and you paint it with k colors, you are guaranteed to have monochromatic subgraphs within Kv that are identical to the arbitrary graphs you started with. The specifications for the complete graph are that it must have a number of vertices greater than or equal to the Ramsey number (R(G1, G2, …, Gk) ). The theorem states that such a Ramsey number always exists, no matter what arbitrary graphs and colors you pick.

This builds upon the lemma we just proved, which had limited results:
Point 1: We showed that a Ramsey number R(G1, G2) always exists. We only proved this for when the G1 and G2 are complete graphs.
Point 2: We tested for only 2 colors, ci, for some i where i = 1 or 2.
As you saw in the theorem's statement, we will now expand on both of these points. We will see that the graphs Gk do not have to be complete, and that we can color a sufficiently large Kv with more than 2 colors and still find monochromatic subgraphs.

A word on notation before we start:

• The number of vertices in Gi is denoted as v(Gi).
• The notation Gk does not necessarily mean that the graph G has k vertices. It can be any graph. Instead, we use v(Gk) to indicate the size of the monochromatic subgraph we are looking for, just as R(3,3) meant that we were looking for a monochromatic, complete subgraph with 3 vertices.
• If all the graphs are complete graphs, i.e. G1 = Kp1, G2 = Kp2, ..., Gk = Kpk , then R(Kp1, Kp2, ..., Kpk) is rewritten as R(p1, p2, ..., pk).

Proof:

Expanding Point 1

Kv(Gi) is the complete graph that has the same number of vertices as Gi. Proving the theorem for Kv(Gi) implies the proof for Gi. To see why, say that v is large enough that a k-painted Kv contains a monochromatic Kv(Gi) in color ci :

 3-painted K7.... ...contains blue monochromatic Kv(Gi). Kv(Gi) (isomorphic to K5)

The number of edges in Kv(Gi) is greater or equal to the number of edges in Gi :

 Kv(Gi)... ...contains Gi

It necessarily follows that if Kv contains a monochromatic Kv(Gi) in color ci, it will also contain a monochromatic Gi in the same color. In other words:

$R(K_{v(G_1)}, K_{v(G_2)}, ..., K_{v(G_k)}) \ge R(G_1, G_2, ..., G_k)$

This is why it is sufficient to prove this theorem for the case in which all Gi are complete graphs.

Expanding Point 2

In order to prove that R(p1, p2, ..., pk) always exists, we will perform an induction on k.

We previously saw the proof for the basic case, k = 2, in the Lemma. Now assume that for k < Q, R(p1, p2, ..., pk) exists. Then if the integers p1, p2, ..., pQ are given, R(p1, p2, ..., pQ - 1) exists.

Let's take the graph Kv, where vR ( R(p1, p2, ..., pQ - 1), pQ ). We know that the Ramsey number R ( R(p1, p2, ..., pQ - 1), pQ ) exists, due to the lemma we proved before, and we already assumed that R(p1, p2, ..., pQ - 1) exists in the previous step. Remember that R(p1, p2, ..., pQ - 1) is the minimum number of vertices a complete graph (let's call it KP) must have to contain the monochromatic subgraphs Kp1, Kp2, ..., KpQ - 1. This means that R ( R(p1, p2, ..., pQ - 1), pQ ) is the minimum number of vertices a complete graph must have to contain either a monochromatic KP or a monochromatic KQ.

Now take this Kv and paint it in any k colors. Here's the induction step: let's say that k = Q.

For all edges painted in a color other than ck, temporarily assign a new color cm. This creates a 2-painting, which we already know how to analyze! The repainted graph must contain either a KR(p1, p2, ..., pQ - 1) monochromatic subgraph in color cm or a KpQ monochromatic subgraph in color cQ.

Take the former subgraph, KR(p1, p2, ..., pQ - 1), and look at it in the original painting (before its edges were recolored to cm). It has edges in colors c1, c2, ..., cQ - 1 only. Therefore, by induction, it contains a monochromatic Kpi painted in color ci for some i.

This shows that a Ramsey number R(p1, p2, …, pk) always exists. When a k-painting of Kv has a number of vertices greater or equal to this Ramsey number, it must contain a monochromatic Kpi subgraph in color i, for some i where 1 ≤ ik.

### Ramsey Numbers

It is extremely difficult to compute Ramsey numbers for increasingly larger graphs. Many of the Ramsey numbers have been determined by using exhaustive computer algorithms that compute a range of numbers, given values for m and n.

# Why It's Interesting

### Impossibility of Disorder

Total disorder in a graph is impossible. To extend the party metaphor, imagine that you invite more than 6 people. Regardless of how many people you invite, there will always be at least 3 people who are mutual acquaintances or acquaintances.

Take any infinite graph you'd like. If you color it with an arbitrary, finite number of colors, there will always exist monochromatic subgraphs. So no matter how you color the graph, there will always be pockets of order.

There will always be an island of order in random, infinite chaos. Sounds quite poetic, right?

More generally: Regardless of the size of a system, if it's partitioned arbitrarily into subsystems, at least one subsystem will have a property that is shared by its constituents (monochromaticism, for example).

# References

1. 1.0 1.1 Wallis, W. D. A Beginner's Guide to Graph Theory. Boston: Birkhäuser, 2000.

Ryser, Hervert John. The Carus Mathematical Monographs: Combinatorial Mathematics. Vol. Fourteen. Rahway: Quinn & Boden Company, Inc., 1963.

Caldwell, Chris. "Graph Theory Glossary." Graph Theory Glossary. 19 June 2012 <http://primes.utm.edu/cgi-bin/caldwell/tutor/graph/glossary.html>.

"Ramsey's theorem." Wikipedia. 18 June 2012. 19 June 2012 <http://en.wikipedia.org/wiki/Ramsey%27s_theorem#Extensions_of_the_theorem>.

Weisstein, Eric W. "Ramsey Number." MathWorld--A Wolfram Web Resource. 19 June 2012 <http://mathworld.wolfram.com/RamseyNumber.html>.