1.
Reinforcement learning for graph theory, II. Small Ramsey numbersMohammad Ghebleh,
Salem Al-Yakoob,
Ali Kanso,
Dragan Stevanović, 2025, original scientific article
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₇).
Keywords: Ramsey number, critical graph, reinforcement learning, cross-entropy method
Published in RUP: 03.11.2025; Views: 726; Downloads: 7
Full text (291,40 KB)
