Note
This short note is to discuss the idea of arXiv:2507.12926. It updates the lower bound of the non-diagonal Ramsey number (in fact very far from diagonal).
Ramsey Number
The Ramsey Number denotes the smallest size of red-blue colored complete graph that always contains either a red clique or a blue .
The upper bound of was made by Erdős and Szekeres through induction
Basically, if we choose a node , and the rest of nodes are grouped depending on the edge connected to , then we only need to look at the two groups, either the red group has at least nodes or the blue group has at least nodes, then proved. This simple proof makes an upper estimate of . The proof is not constructive.
For the lower bound, it will depend on a construction such that the numbers of red or blue cliques do not meet the bound.
Random Sphere Graph
In the paper arXiv:2507.12926, it introduces a graph placed on the high dimensional sphere , the each node is connected to nearby nodes with blue edges and far nodes with red, when the points are sampled uniformly on the sphere, the probably space is , and a clique means the points are far from each other, or the intersection of far regions has nonzero measure.
Let be the probability of appearance of a red clique and for a blue clique on this random sphere graph of size in dimensions. Then the lower bound of can be found if:
It means there exists a configuration of points on the random sphere graph making both not happen.
The key idea will be estimating and , with a well-chosen dimension . Because if is too high, almost all points are very far from each other, the distance is meaningless, the whole graph loses its geometric information and degenerates to the traditional graph .