I'm looking for a 2-page paper on a lower bound of Ramsey number $R(a,b)$ for some constants $a$ and $b$. The paper was published in 80s or 90s. I googled it for a few days, but I cannot find the paper.
The paper improves the lower bound of $R(a,b)$ to $n + 1$ by constructing a graph with $n$ vertices without $K_a$ in one color (red) nor $K_b$ in the other color (blue). IIRC $20 < n < 30$. It constructs the graph in the following steps:
- Step 1. Place $n$ vertices on a circle.
- Step 2. If $u, v \in V$ has odd number of vertices between them along the circle, color $uv \in E$ to one color (red). Otherwise, color $uv$ to the other color (blue).
- Step 3. There is a list of a dozen of edges to change the color.
Can anyone help me to find this paper?