| Title: | Reinforcement learning for graph theory, II. Small Ramsey numbers |
|---|
| Authors: | ID Ghebleh, Mohammad (Author)
ID Al-Yakoob, Salem (Author)
ID Kanso, Ali (Author)
ID Stevanović, Dragan (Author) |
|---|
| Files: |  RAZ_Ghebleh,Al-Yakoob,Kanso,Stevanovic_2025.pdf (291,40 KB)
MD5: FD772DDE79517BDC53715A13C60E0864
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| 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 |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 25.02.2025 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | 7 str. |
|---|
| Numbering: | Vol. 8, no. 1, [article no.] P1.07 |
|---|
| PID: | 20.500.12556/RUP-22063  |
|---|
| UDC: | 519.17 |
|---|
| eISSN: | 2590-9770 |
|---|
| DOI: | https://doi.org/10.26493/2590-9770.1788.8af |
|---|
| Publication date in RUP: | 03.11.2025 |
|---|
| Views: | 218 |
|---|
| Downloads: | 2 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
