Answers are grounded in this paper and cite their sources.
We describe here how the recent Wagner’s approach for applying reinforcement learning to construct examples in graph theory can be used in the search for critical graphs for small Ramsey numbers. We illustrate this application by providing lower bounds for the small Ramsey numbers R(K2, 5, K3, 5), R(B₃, B₆) and R(B₄, B₅) and by improving the lower known bound for R(W₅, W₇).
No takes yet. Share an insight, caveat, or question.
Ghebleh et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: