← All problems

Alon's conjecture on Ramsey Cayley graphs

19 years old · traced to

Let GG be a finite group. A Cayley graph of GG is formed from a symmetric subset S⊂GS\subset G by joining x,y∈Gx,y\in G when x−1y∈Sx^{-1}y\in S. Such a graph is CC-Ramsey if it has no clique or independent set of size larger than Clog⁡2∣G∣C\log_2|G|. Alon's conjecture. There exists some absolute constant C>0C>0 for which every finite group has a CC-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

Never refreshed

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.