20.500.12556/RUP-22063 Reinforcement learning for graph theory, II. Small Ramsey numbers Učenje s krepitvijo in teorija grafov, II. Majhna Ramseyeva števila 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₇). Ramsey number critical graph reinforcement learning cross-entropy method Ramseyjevo število kritični graf učenje s krepitvijo navzkrižna entropijska metoda true false true Založba Univerze na Primorskem Angleški jezik Slovenski jezik Članek v reviji 2025-11-03 10:36:20 2025-11-03 10:36:20 2025-11-04 03:08:24 0000-00-00 00:00:00 2025 0 0 7 str. no. 1, [article no.] P1.07 Vol. 8 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2025-02-25 519.17 2590-9770 https://doi.org/10.26493/2590-9770.1788.8af RAZ_Ghebleh,Al-Yakoob,Kanso,Stevanovic_2025.pdf RAZ_Ghebleh,Al-Yakoob,Kanso,Stevanovic_2025.pdf 1 FD772DDE79517BDC53715A13C60E0864 24582297851a79e1c030f2b6477543777437516f44bc6c182e13c126120122bd 379dcf38-b899-11f0-8f0b-005056ac49c0 https://repozitorij.upr.si/Dokument.php?lang=slv&id=32008 Založba Univerze na Primorskem 0 0 0