Ramsey's theorem

A 2-edge-labeling of K₅ with no monochromatic K₃

Suppose the edges of a complete graph on 6 vertices are coloured red and blue. Pick a vertex, v. There are 5 edges incident to v and so (by the pigeonhole principle) at least 3 of them must be the same colour. Without loss of generality we can assume at least 3 of these edges, connecting the vertex, v, to vertices, r, s and t, are blue. (If not, exchange red and blue in what follows.) If any of the edges, (rs), (rt), (st), are also blue then we have an entirely blue triangle. If not, then those three edges are all red and we have an entirely red triangle. Since this argument works for any colouring, any K₆ contains a monochromatic K₃, and therefore R(3, 3) ≤ 6. The popular version of this is called the theorem on friends and strangers.

An alternative proof works by double counting. It goes as follows: Count the number of ordered triples of vertices, x, y, z, such that the edge, (xy), is red and the edge, (yz), is blue. Firstly, any given vertex will be the middle of either 0 × 5 = 0 (all edges from the vertex are the same colour), 1 × 4 = 4 (four are the same colour, one is the other colour), or 2 × 3 = 6 (three are the same colour, two are the other colour) such triples. Therefore, there are at most 6 × 6 = 36 such triples. Secondly, for any non-monochromatic triangle (xyz), there exist precisely two such triples. Therefore, there are at most 18 non-monochromatic triangles. Therefore, at least 2 of the 20 triangles in the K₆ are monochromatic.

Conversely, it is possible to 2-colour a K₅ without creating any monochromatic K₃, showing that R(3, 3) > 5. The unique[lower-alpha 1] colouring is shown to the right. Thus R(3, 3) = 6.

The task of proving that R(3, 3) ≤ 6 was one of the problems of William Lowell Putnam Mathematical Competition in 1953, as well as in the Hungarian Math Olympiad in 1947.

The only two 3-colourings of K₁₆ with no monochromatic K₃. The untwisted colouring (above) and the twisted colouring (below).

A multicolour Ramsey number is a Ramsey number using 3 or more colours. There are (up to symmetries) only two non-trivial multicolour Ramsey numbers for which the exact value is known, namely R(3, 3, 3) = 17 and R(3, 3, 4) = 30.[2]

Suppose that we have an edge colouring of a complete graph using 3 colours, red, green and blue. Suppose further that the edge colouring has no monochromatic triangles. Select a vertex v. Consider the set of vertices that have a red edge to the vertex v. This is called the red neighbourhood of v. The red neighbourhood of v cannot contain any red edges, since otherwise there would be a red triangle consisting of the two endpoints of that red edge and the vertex v. Thus, the induced edge colouring on the red neighbourhood of v has edges coloured with only two colours, namely green and blue. Since R(3, 3) = 6, the red neighbourhood of v can contain at most 5 vertices. Similarly, the green and blue neighbourhoods of v can contain at most 5 vertices each. Since every vertex, except for v itself, is in one of the red, green or blue neighbourhoods of v, the entire complete graph can have at most 1 + 5 + 5 + 5 = 16 vertices. Thus, we have R(3, 3, 3) ≤ 17.

To see that R(3, 3, 3) = 17, it suffices to draw an edge colouring on the complete graph on 16 vertices with 3 colours that avoids monochromatic triangles. It turns out that there are exactly two such colourings on K₁₆, the so-called untwisted and twisted colourings. Both colourings are shown in the figures to the right, with the untwisted colouring on the top, and the twisted colouring on the bottom.

Clebsch graph

If we select any colour of either the untwisted or twisted colouring on K₁₆, and consider the graph whose edges are precisely those edges that have the specified colour, we will get the Clebsch graph.

It is known that there are exactly two edge colourings with 3 colours on K₁₅ that avoid monochromatic triangles, which can be constructed by deleting any vertex from the untwisted and twisted colourings on K₁₆, respectively.

It is also known that there are exactly 115 edge colourings with 3 colours on K₁₄ that avoid monochromatic triangles, provided that we consider edge colourings that differ by a permutation of the colours as being the same.

The theorem for the 2-colour case can be proved by induction on r + s.[3] It is clear from the definition that for all n, R(n, 2) = R(2, n) = n. This starts the induction. We prove that R(r, s) exists by finding an explicit bound for it. By the inductive hypothesis R(r − 1, s) and R(r, s − 1) exist.

Lemma 1. ${\displaystyle R(r,s)\leq R(r-1,s)+R(r,s-1).}$

Proof. Consider a complete graph on R(r − 1, s) + R(r, s − 1) vertices whose edges are coloured with two colours. Pick a vertex v from the graph, and partition the remaining vertices into two sets M and N, such that for every vertex w, w is in M if edge (vw) is blue, and w is in N if (vw) is red. Because the graph has ${\displaystyle R(r-1,s)+R(r,s-1)=|M|+|N|+1}$ vertices, it follows that either ${\displaystyle |M|\geq R(r-1,s)}$ or ${\displaystyle |N|\geq R(r,s-1).}$ In the former case, if M has a red K_s then so does the original graph and we are finished. Otherwise M has a blue K_{r − 1} and so ${\displaystyle M\cup \{v\}}$ has a blue K_r by the definition of M. The latter case is analogous. Thus the claim is true and we have completed the proof for 2 colours.

In this 2-colour case, if R(r − 1, s) and R(r, s − 1) are both even, the induction inequality can be strengthened to:[4]

${\displaystyle R(r,s)\leq R(r-1,s)+R(r,s-1)-1.}$

Proof. Suppose p = R(r − 1, s) and q = R(r, s − 1) are both even. Let t = p + q − 1 and consider a two-coloured graph of t vertices. If d_i is degree of i-th vertex in the blue subgraph, then, according to the Handshaking lemma, ${\displaystyle \textstyle \sum _{i=1}^{t}d_{i}}$ is even. Given that t is odd, there must be an even d_i. Assume d₁ is even, M and N are the vertices incident to vertex 1 in the blue and red subgraphs, respectively. Then both ${\displaystyle |M|=d_{1}}$ and ${\displaystyle |N|=t-1-d_{1}}$ are even. According to the Pigeonhole principle, either ${\displaystyle |M|\geq p-1,}$ or ${\displaystyle |N|\geq q.}$ Since |M| is even, while p – 1 is odd, the first inequality can be strengthened, so either ${\displaystyle |M|\geq p}$ or ${\displaystyle |N|\geq q.}$ Suppose ${\displaystyle |M|\geq p=R(r-1,s).}$ Then either the M subgraph has a red K_s and the proof is complete, or it has a blue K_{r – 1} which along with vertex 1 makes a blue K_r. The case ${\displaystyle |N|\geq q=R(r,s-1)}$ is treated similarly.

Lemma 2. If c > 2, then ${\displaystyle R(n_{1},\dots ,n_{c})\leq R(n_{1},\dots ,n_{c-2},R(n_{c-1},n_{c})).}$

Proof. Consider a complete graph of ${\displaystyle R(n_{1},\dots ,n_{c-2},R(n_{c-1},n_{c}))}$ vertices and colour its edges with c colours. Now 'go colour-blind' and pretend that c − 1 and c are the same colour. Thus the graph is now (c − 1)-coloured. Due to the definition of ${\displaystyle R(n_{1},\dots ,n_{c-2},R(n_{c-1},n_{c})),}$ such a graph contains either a K_ni mono-chromatically coloured with colour i for some 1 ≤ i ≤ c − 2 or a K_{R(nc − 1, nc)}-coloured in the 'blurred colour'. In the former case we are finished. In the latter case, we recover our sight again and see from the definition of R(n_{c − 1}, n_c) we must have either a (c − 1)-monochrome K_{nc − 1} or a c-monochrome K_nc. In either case the proof is complete.

Lemma 1 implies that any R(r,s) is finite. The right hand side of the inequality in Lemma 2 expresses a Ramsey number for c colours in terms of Ramsey numbers for fewer colours. Therefore any R(n₁, …, n_c) is finite for any number of colours. This proves the theorem.

Erdős asks us to imagine an alien force, vastly more powerful than us, landing on Earth and demanding the value of R(5, 5) or they will destroy our planet. In that case, he claims, we should marshal all our computers and all our mathematicians and attempt to find the value. But suppose, instead, that they ask for R(6, 6). In that case, he believes, we should attempt to destroy the aliens.

— Joel Spencer[6]

A sophisticated computer program does not need to look at all colourings individually in order to eliminate all of them; nevertheless it is a very difficult computational task that existing software can only manage on small sizes. Each complete graph K_n has 1/2n(n − 1) edges, so there would be a total of c^n(n-1)/2 graphs to search through (for c colours) if brute force is used.[7] Therefore, the complexity for searching all possible graphs (via brute force) is O(cⁿ²) for c colourings and at most n nodes.

The situation is unlikely to improve with the advent of quantum computers. The best known algorithm exhibits only a quadratic speedup (c.f. Grover's algorithm) relative to classical computers, so that the computation time is still exponential in the number of nodes.[8]

As described above, R(3, 3) = 6. It is easy to prove that R(4, 2) = 4, and, more generally, that R(s, 2) = s for all s: a graph on s − 1 nodes with all edges coloured red serves as a counterexample and proves that R(s, 2) ≥ s; among colourings of a graph on s nodes, the colouring with all edges coloured red contains a s-node red subgraph, and all other colourings contain a 2-node blue subgraph (that is, a pair of nodes connected with a blue edge.)

Using induction inequalities, it can be concluded that R(4, 3) ≤ R(4, 2) + R(3, 3) − 1 = 9, and therefore R(4, 4) ≤ R(4, 3) + R(3, 4) ≤ 18. There are only two (4, 4, 16) graphs (that is, 2-colourings of a complete graph on 16 nodes without 4-node red or blue complete subgraphs) among 6.4 × 10²² different 2-colourings of 16-node graphs, and only one (4, 4, 17) graph (the Paley graph of order 17) among 2.46 × 10²⁶ colourings.[5] (This was proven by Evans, Pulham and Sheehan in 1979.) It follows that R(4, 4) = 18.

The fact that R(4, 5) = 25 was first established by Brendan McKay and Stanisław Radziszowski in 1995.[9]

The exact value of R(5, 5) is unknown, although it is known to lie between 43 (Geoffrey Exoo (1989)[10]) and 48 (Angeltveit and McKay (2017)[11]) (inclusive).

In 1997, McKay, Radziszowski and Exoo employed computer-assisted graph generation methods to conjecture that R(5, 5) = 43. They were able to construct exactly 656 (5, 5, 42) graphs, arriving at the same set of graphs through different routes. None of the 656 graphs can be extended to a (5, 5, 43) graph.[12]

For R(r, s) with r, s > 5, only weak bounds are available. Lower bounds for R(6, 6) and R(8, 8) have not been improved since 1965 and 1972, respectively.[2]

R(r, s) with r, s ≤ 10 are shown in the table below. Where the exact value is unknown, the table lists the best known bounds. R(r, s) with r < 3 are given by R(1, s) = 1 and R(2, s) = s for all values of s.

The standard survey on the development of Ramsey number research is the Dynamic Survey 1 of the Electronic Journal of Combinatorics, by Stanisław Radziszowski, which is periodically updated.[2] Where not cited otherwise, entries in the table below are taken from the January 2021 edition. (Note there is a trivial symmetry across the diagonal since R(r, s) = R(s, r).)

The inequality R(r, s) ≤ R(r − 1, s) + R(r, s − 1) may be applied inductively to prove that

${\displaystyle R(r,s)\leq {\binom {r+s-2}{r-1}}.}$

In particular, this result, due to Erdős and Szekeres, implies that when r = s,

${\displaystyle R(s,s)\leq [1+o(1)]{\frac {4^{s-1}}{\sqrt {\pi s}}}.}$

An exponential lower bound,

${\displaystyle R(s,s)\geq [1+o(1)]{\frac {s}{{\sqrt {2}}e}}2^{s/2},}$

was given by Erdős in 1947 and was instrumental in his introduction of the probabilistic method. There is obviously a huge gap between these two bounds: for example, for s = 10, this gives 101 ≤ R(10, 10) ≤ 48,620. Nevertheless, exponential growth factors of either bound have not been improved to date and still stand at 4 and √2 respectively. There is no known explicit construction producing an exponential lower bound. The best known lower and upper bounds for diagonal Ramsey numbers currently stand at

${\displaystyle [1+o(1)]{\frac {{\sqrt {2}}s}{e}}2^{\frac {s}{2}}\leq R(s,s)\leq s^{-(c\log s)/(\log \log s)}4^{s},}$

due to Spencer and Conlon respectively.

For the off-diagonal Ramsey numbers R(3, t), it is known that they are of order t²/log t; this may be stated equivalently as saying that the smallest possible independence number in an n-vertex triangle-free graph is

${\displaystyle \Theta \left({\sqrt {n\log n}}\right).}$

The upper bound for R(3, t) is given by Ajtai, Komlós, and Szemerédi, the lower bound was obtained originally by Kim, and was improved by Griffiths, Morris, Fiz Pontiveros, and Bohman and Keevash, by analysing the triangle-free process. More generally, for off-diagonal Ramsey numbers, R(s, t), with s fixed and t growing, the best known bounds are

${\displaystyle c'_{s}{\frac {t^{\frac {s+1}{2}}}{(\log t)^{{\frac {s+1}{2}}-{\frac {1}{s-2}}}}}\leq R(s,t)\leq c_{s}{\frac {t^{s-1}}{(\log t)^{s-2}}},}$

due to Bohman and Keevash and Ajtai, Komlós and Szemerédi respectively.

Let H be a graph on n vertices. Then, there exists a graph G such that any coloring of the edges of G using two colors contains a monochromatic induced copy of H (i.e. an induced subgraph of G such that it is isomorphic to H and its edges are monochromatic). The smallest possible number of vertices of G is the induced Ramsey number r_ind(H).

Sometimes, we also consider the asymmetric version of the problem. We define r_ind(X,Y) to be the smallest possible number of vertices of a graph G such that every coloring of the edges of G using only red or blue contains a red induced subgraph of X or blue induced subgraph of Y.

Similar to Ramsey's Theorem, it is unclear a priori whether induced Ramsey numbers exist for every graph H. In the early 1970s, Erdős, Hajnal and Pósa, Deuber and Rödl independently proved that this is the case. [14][15][16] However, the original proofs gave terrible bounds (e.g. towers of twos) on the induced Ramsey numbers. It is interesting to ask if better bounds can be achieved. In 1974, Paul Erdős conjectured that there exists a constant c such that every graph H on k vertices satisfies r_ind(H) ≤ 2^ck. [17] If this conjecture is true, it would be optimal up to the constant c because the complete graph achieves a lower bound of this form (in fact, it's the same as Ramsey numbers). However, this conjecture is still open as of now.

In 1984, Erdős and Hajnal claimed that they proved the bound[18]

${\displaystyle r_{\text{ind}}(H)\leq 2^{2^{k^{1+o(1)}}}.}$

However, that was still far from the exponential bound conjectured by Erdős. It was not until 1998 when a major breakthrough was achieved by Kohayakawa, Prömel and Rödl, who proved the first almost-exponential bound of r_ind(H) ≤ 2^{ck(log k)2} for some constant c. Their approach was to consider a suitable random graph constructed on projective planes and show that it has the desired properties with nonzero probability. The idea of using random graphs on projective planes have also previously been used in studying Ramsey properties with respect to vertex colorings and the induced Ramsey problem on bounded degree graphs H.[19]

Kohayakawa, Prömel and Rödl's bound remained the best general bound for a decade. In 2008, Fox and Sudakov provided an explicit construction for induced Ramsey numbers with the same bound. [20] In fact, they showed that every (n,d,λ)-graph G with small λ and suitable d contains an induced monochromatic copy of any graph on k vertices in any coloring of edges of G in two colors. In particular, for some constant c, the Paley graph on n ≥ 2^{ck log2k} vertices is such that all of its edge colorings in two colors contain an induced monochromatic copy of every k-vertex graph.

In 2010, Conlon, Fox and Sudakov were able to improve the bound to r_ind(H) ≤ 2^{ck log k}, which remains the current best upper bound for general induced Ramsey numbers. [21] Similar to the previous work in 2008, they showed that every (n,d,λ)-graph G with small λ and edge density 1⁄2 contains an induced monochromatic copy of every graph on k vertices in any edge coloring in two colors. Currently, Erdős's conjecture that r_ind(H) ≤ 2^ck remains open and is one of the important problems in extremal graph theory.

For lower bounds, not much is known in general except for the fact that induced Ramsey numbers must be at least the corresponding Ramsey numbers. Some lower bounds have been obtained for some special cases (see Special Cases).

While the general bounds for the induced Ramsey numbers are exponential in the size of the graph, the behaviour is much different on special classes of graphs (in particular, sparse ones). Many of these classes have induced Ramsey numbers polynomial in the number of vertices.

If H is a cycle, path or star on k vertices, it is known that r_ind(H) is linear in k. [20]

If H is a tree on k vertices, it is known that r_ind(H) = O(k² log²k).[22] It is also known that r_ind(H) is superlinear (i.e. r_ind(H) = ω(k)). Note that this is in contrast to the usual Ramsey numbers, where the Burr–Erdős conjecture (now proven) tells us that r(H) is linear (since trees are 1-degenerate).

For graphs H with number of vertices k and bounded degree Δ, it was conjectured that r_ind(H) ≤ cn^d(Δ), for some constant d depending only on Δ. This result was first proven by Łuczak and Rödl in 1996, with d(Δ) growing as a tower of twos with height O(Δ²).[23] More reasonable bounds for d(Δ) were obtained since then. In 2013, Conlon, Fox and Zhao showed using a counting lemma for sparse pseudorandom graphs that r_ind(H) ≤ cn^2Δ+8, where the exponent is best possible up to constant factors. [24]

Similar to Ramsey numbers, we can generalize the notion of induced Ramsey numbers to hypergraphs and multicolor settings.

We can also generalize the induced Ramsey's theorem to a multicolor setting. For graphs H₁, H₂, …, H_r, define r_ind(H₁, H₂, …, H_r) to be the minimum number of vertices in a graph G such that any coloring of the edges of G into r colors contain a induced subgraph isomorphic to H_i where all edges are colored in the i-th color for some 1 ≤ i ≤ r. Let r_ind(H;q) := r_ind(H, H, …, H) (q copies of H).

It is possible to derive a bound on r_ind(H;q) which is approximately a tower of two of height ~ log q by iteratively applying the bound on the two-color case. The current best known bound is due to Fox and Sudakov, which achieves r_ind(H;q) ≤ 2^ck3, where k is the number of vertices of H and c is a constant depending only on q. [25]

We can extend the definition of induced Ramsey numbers to d-uniform hypergraphs by simply changing the word graph in the statement to hypergraph. Furthermore, we can define the multicolor version of induced Ramsey numbers in the same way as the previous subsection.

Let H be a d-uniform hypergraph with k vertices. Define the tower function t_r(x) by letting t₁(x) = x and for i ≥ 1, t_i+1(x) = 2^t_i(x). Using the hypergraph container method, Conlon, Dellamonica, La Fleur, Rödl and Schacht were able to show that for d ≥ 3, q ≥ 2, r_ind(H;q) ≤ t_d(ck) for some constant c depending on only d and q. In particular, this result mirrors the best known bound for the usual Ramsey number when d = 3. [26]

A further result, also commonly called Ramsey's theorem, applies to infinite graphs. In a context where finite graphs are also being discussed it is often called the "Infinite Ramsey theorem". As intuition provided by the pictorial representation of a graph is diminished when moving from finite to infinite graphs, theorems in this area are usually phrased in set-theoretic terminology.[27]

Theorem. Let X be some infinite set and colour the elements of X ⁽ⁿ⁾ (the subsets of X of size n) in c different colours. Then there exists some infinite subset M of X such that the size n subsets of M all have the same colour.

Proof: The proof is by induction on n, the size of the subsets. For n = 1, the statement is equivalent to saying that if you split an infinite set into a finite number of sets, then one of them is infinite. This is evident. Assuming the theorem is true for n ≤ r, we prove it for n = r + 1. Given a c-colouring of the (r + 1)-element subsets of X, let a₀ be an element of X and let Y = X \ {a₀}. We then induce a c-colouring of the r-element subsets of Y, by just adding a₀ to each r-element subset (to get an (r + 1)-element subset of X). By the induction hypothesis, there exists an infinite subset Y₁ of Y such that every r-element subset of Y₁ is coloured the same colour in the induced colouring. Thus there is an element a₀ and an infinite subset Y₁ such that all the (r + 1)-element subsets of X consisting of a₀ and r elements of Y₁ have the same colour. By the same argument, there is an element a₁ in Y₁ and an infinite subset Y₂ of Y₁ with the same properties. Inductively, we obtain a sequence {a₀, a₁, a₂, …} such that the colour of each (r + 1)-element subset (a_i(1), a_i(2), …, a_{i(r + 1)}) with i(1) < i(2) < … < i(r + 1) depends only on the value of i(1). Further, there are infinitely many values of i(n) such that this colour will be the same. Take these a_i(n)'s to get the desired monochromatic set.

A stronger but unbalanced infinite form of Ramsey's theorem for graphs, the Erdős–Dushnik–Miller theorem, states that every infinite graph contains either a countably infinite independent set, or an infinite clique of the same cardinality as the original graph.[28]

It is possible to deduce the finite Ramsey theorem from the infinite version by a proof by contradiction. Suppose the finite Ramsey theorem is false. Then there exist integers c, n, T such that for every integer k, there exists a c-colouring of [k]⁽ⁿ⁾ without a monochromatic set of size T. Let C_k denote the c-colourings of [k]⁽ⁿ⁾ without a monochromatic set of size T.

For any k, the restriction of a colouring in C_k+1 to [k]⁽ⁿ⁾ (by ignoring the colour of all sets containing k + 1) is a colouring in C_k. Define ${\displaystyle C_{k}^{1}}$ to be the colourings in C_k which are restrictions of colourings in C_k+1. Since C_k+1 is not empty, neither is ${\displaystyle C_{k}^{1}}$.

Similarly, the restriction of any colouring in ${\displaystyle C_{k+1}^{1}}$ is in ${\displaystyle C_{k}^{1}}$, allowing one to define ${\displaystyle C_{k}^{2}}$ as the set of all such restrictions, a non-empty set. Continuing so, define ${\displaystyle C_{k}^{m}}$ for all integers m, k.

Now, for any integer k,

${\displaystyle C_{k}\supseteq C_{k}^{1}\supseteq C_{k}^{2}\supseteq \cdots }$

and each set is non-empty. Furthermore, C_k is finite as

${\displaystyle |C_{k}|\leq c^{\frac {k!}{n!(k-n)!}}}$

It follows that the intersection of all of these sets is non-empty, and let

${\displaystyle D_{k}=C_{k}\cap C_{k}^{1}\cap C_{k}^{2}\cap \cdots }$

Then every colouring in D_k is the restriction of a colouring in D_k+1. Therefore, by unrestricting a colouring in D_k to a colouring in D_k+1, and continuing doing so, one constructs a colouring of ${\displaystyle \mathbb {N} ^{(n)}}$ without any monochromatic set of size T. This contradicts the infinite Ramsey theorem.

If a suitable topological viewpoint is taken, this argument becomes a standard compactness argument showing that the infinite version of the theorem implies the finite version.[29]

The theorem can also be extended to hypergraphs. An m-hypergraph is a graph whose "edges" are sets of m vertices – in a normal graph an edge is a set of 2 vertices. The full statement of Ramsey's theorem for hypergraphs is that for any integers m and c, and any integers n₁, …, n_c, there is an integer R(n₁, …, n_c; m) such that if the hyperedges of a complete m-hypergraph of order R(n₁, …, n_c; m) are coloured with c different colours, then for some i between 1 and c, the hypergraph must contain a complete sub-m-hypergraph of order n_i whose hyperedges are all colour i. This theorem is usually proved by induction on m, the 'hyper-ness' of the graph. The base case for the proof is m = 2, which is exactly the theorem above.

For m = 3 we know the exact value of one non-trivial Ramsey number, namely R(4, 4; 3) = 13. This fact was established by Brendan McKay and Stanisław Radziszowski in 1991.[30] Additionaly, we have: R(4, 5; 3) ≥ 35,[31] R(4, 6; 3) ≥ 63 and R(5, 5; 3) ≥ 88.[31]

It is also possible to define Ramsey numbers for directed graphs; these were introduced by P. Erdős and L. Moser (1964). Let R(n) be the smallest number Q such that any complete graph with singly directed arcs (also called a "tournament") and with ≥ Q nodes contains an acyclic (also called "transitive") n-node subtournament.

This is the directed-graph analogue of what (above) has been called R(n, n; 2), the smallest number Z such that any 2-colouring of the edges of a complete undirected graph with ≥ Z nodes, contains a monochromatic complete graph on n nodes. (The directed analogue of the two possible arc colours is the two directions of the arcs, the analogue of "monochromatic" is "all arc-arrows point the same way"; i.e., "acyclic.")

We have R(0) = 0, R(1) = 1, R(2) = 2, R(3) = 4, R(4) = 8, R(5) = 14, R(6) = 28, and 34 ≤ R(7) ≤ 47.[32][33]

In terms of the partition calculus Ramsey's theorem can be stated as ${\displaystyle \aleph _{0}\rightarrow (\aleph _{0})_{k}^{n}}$ for all finite n and k. A Ramsey cardinal, ${\displaystyle \kappa }$, is a large cardinal axiomatically defined to satisfy the related formula: ${\displaystyle \kappa \rightarrow (\kappa )_{2}^{<\omega }}$.