Alon's conjecture on Ramsey Cayley graphs
Let be a finite group. A Cayley graph of is formed from a symmetric subset by joining when . Such a graph is -Ramsey if it has no clique or independent set of size larger than . Alon's conjecture. There exists some absolute constant for which every finite group has a -Ramsey Cayley graph. The conjecture is the central motivation of the paper; the authors confirm it for groups of almost all orders, but the general case remains open.
References
2 papers in this index state this conjecture (2007–2025). The statement above is taken from the most recent of them; the others are arXiv:0711.0081.
Source: Carl Schildkraut, “Abelian structure in approximate groups and Alon's conjecture on Ramsey Cayley graphs”, arXiv:2512.15125 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.