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(B3, B6) and R(B4, B5) and by improving the lower known bound for R(W5, W7).

Rights

URN

URN:NBN:SI:DOC-EETSBUTL

COBISSID

285595651

DOI

10.26493/2590-9770.1788.8af

Added

08.09.2026

Metadata

Citation

APA:

Ghebleh, Mohammad, Al-Yakoob, Salem, Kanso, Ali, Stevanović, Dragan (2025). Reinforcement learning for graph theory, II. Small Ramsey numbers. The art of discrete and applied mathematics, volume 8, issue 1, article p1.07, str. 1-7. URN:NBN:SI:DOC-EETSBUTL from http://www.dlib.si

MLA:

Ghebleh, Mohammad, Al-Yakoob, Salem, Kanso, Ali, Stevanović, Dragan. "Reinforcement learning for graph theory, II. Small Ramsey numbers." The art of discrete and applied mathematics volume 8. issue 1. article p1.07 (2025) str. 1-7.
<http://www.dlib.si/?URN=URN:NBN:SI:DOC-EETSBUTL>