Reinforcement learning for graph theory, II. Small Ramsey numbers
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916183950753792 |
|---|---|
| author | Ghebleh, Mohammad Al-Yakoob, Salem Kanso, Ali Stevanović, Dragan |
| author_facet | Ghebleh, Mohammad Al-Yakoob, Salem Kanso, Ali Stevanović, Dragan |
| contents | 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_3, B_6)$ and $R(B_4, B_5)$ and by improving the lower known bound for $R(W_5, W_7)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_20055 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Reinforcement learning for graph theory, II. Small Ramsey numbers Ghebleh, Mohammad Al-Yakoob, Salem Kanso, Ali Stevanović, Dragan Combinatorics 05C55, 05D10, 68T20 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_3, B_6)$ and $R(B_4, B_5)$ and by improving the lower known bound for $R(W_5, W_7)$. |
| title | Reinforcement learning for graph theory, II. Small Ramsey numbers |
| topic | Combinatorics 05C55, 05D10, 68T20 |
| url | https://arxiv.org/abs/2403.20055 |