Reinforcement learning for graph theory, II. Small Ramsey numbers

2024/03/29 by M. Ghebleh, Ghebleh, Mohammad, Salem Al-Yakoob +5 · 1 citation
Computer Science · Mathematics · #05C55 #05D10 #68T20 #Advanced Topology and Set Theory #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2403.20055

openalex publication_date 2024/03/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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(K_2,5, K_3,5), R(B₃, B₆) and R(B₄, B₅) and by improving the lower known bound for R(W₅, W₇).

Cited by

• Reinforcement learning for graph theory, Parallelizing Wagner's approach

Related

• Computational lower limits on small Ramsey numbers
• RamseyRL: A Framework for Intelligent Ramsey Number Counterexample Searching
• A Lower Bound for R(5,6)
• Recent developments in graph Ramsey theory
• Gaussian random graphs and Ramsey numbers