Thanks to Anita Liebenau, I have recently been introduced to some very interesting questions in Ramsey theory and I have been working on them for the past few months in collaboration with various people. In my recent joint work with John Bamberg and Thomas Lesgourgues (Anita’s PhD student), that has just appeared on the arXiv, we have proved an interesting new result in one of these problems. Before I discuss that, let’s look at some background in this post.

The well known fact that in any party of six people either at least three of them are mutual strangers or at least three of them are mutual acquaintances (see this or this), which serves as a nice introduction to Ramsey theory, can be written in graph theoretical terms as follows: any two colouring of the edges of the complete graph contains a monochromatic . Let’s write this statement as , which we read as “* is -Ramsey for ”.*

We can generalise this notion to any two finite graphs and ; let’s write if any -colouring of the edges of contains a monochromatic copy of , and hence is a shorthand for the statement that here exists an -colouring of the edges without a monochromatic . Observe that if then for any graph containing as a subgraph we have , or equivalently, if then for any subgraph of we have . For example, here is a red/blue colouring of minus an edge that has no monochromatic triangles, thus showing that .

This example in fact shows that the graph is *minimal* with respect to being -Ramsey for , since is -Ramsey for but no proper subgraph of has this property.

In general, we say that a graph is **-Ramsey minimal **for another graph , if and for any proper subgraph of we have . Let’s denote the set of all graphs that are -Ramsey minimal for a graph by . Most of the fundament problems in graph Ramsey theory can be seen as trying to understand this set for various graphs . The classical result of Ramsey can be rephrased as:

**Theorem 1. **(Ramsey, 1930) The set is non-empty for any finite graph .

The well studied -colour Ramsey number of a graph , denoted by is simply the smallest number of vertices among all graphs in . Determining, or even estimating, the number , which is denoted by , has been *one of the central longstanding open problem in combinatorics*. The work done towards resolving this has led to significant development in combinatorics. It was shown by Erdős and Szekeres in 1935 that , and in 1947 Erdős proved the lower bound of using a probabilistic argument that led to the creation of what we now call the probabilistic method in combinatorics. But, despite decades of research we still haven’t been able to improve the base of the exponents in these upper and lower bounds! For the most recent development on the upper bounds see this paper by Ashwin Sah.

Other parameters like the number of edges, chromatic number and maximum degree of graphs in , have also been studied extensively. The question that I have been looking into is determining the smallest minimum degree in , which is denoted by . In particular, the new result concerns .

For any graph , the graph with is -Ramsey for , but it might not be minimal. Still, we can look at a subgraph of which is minimal to conclude that . We can see that this gives us the bound , using the upper bound on I mentioned above. In fact, we can’t hope to get any subexponential upper bound on using this easy argument as we also saw that . Quite surprisingly, we do know *exactly *(which is something that rarely happens in Ramsey theory), and it is far far away from an exponential function!

In 1976, Burr, Erdős and Lovász proved that . Thus, they showed that there exists a graph in with minimum degree equal to , and there can’t be any graph in this set with a smaller minimum degree. Determining for is still widely open. It’s an instructive exercise to try to come up with a graph in with minimum degree . The proof of the upper bound by Burr, Erdős and Lovász uses the existence of certain (very large) graphs, known as *signal senders,* that are (i) not -Ramsey for and (ii) in any such monochromatic -free colouring of these graphs two specific edges of the graph receive a specific colour pattern. These signal senders are then used to construct -Ramsey minimal graphs with the required minimum degree. The same idea has been very fruitful in determining for other graphs , and some related problems (see this, this, this and this).

Signal senders are also an important ingredient in the work of Fox, Grinshpun, Liebenau, Person and Szabó, where they reduce the problem of determining to another extremal problem on graph packings. This reduction helped them determine up-to polylogarithmic factors assuming is a constant and . The constants in this bound were terribly large, and in particular not polynomial in . Therefore, they proved the general upper bound of Pushing their idea further, and using a nice finite geometric and group theoretic ingredient that I haven’t seen used anywhere in extremal combinatorics so far, we have managed to improve this general upper bound.

**Theorem 2**. (Bamberg, Bishnoi, Lesgourgues) There exists an absolute constant such that for all and , we have .

I will discuss the details of this result in the next post, and explain the finite geometric aspect of it which I find super interesting. I am really hopeful that the ideas involved will be useful in obtaining new results in other Ramsey problems.

Pingback: Generalized polygons in extremal combinatorics | Anurag's Math Blog

Pingback: Heisenberg groups, irreducible cubics and minimal Ramsey | Anurag's Math Blog