Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.02590 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908306242535424 |
|---|---|
| author | James, David Kahan, Elisha Rauer, Erik |
| author_facet | James, David Kahan, Elisha Rauer, Erik |
| contents | We settle the Ramsey problem $R(K_6 - e, K_4)$, also known as $R(J_6, K_4)$ and $R(K_6^-, K_4)$. Previously, the best bounds were $30 \leq R(K_6 - e, K4) \leq 32$. We prove that $R(K_6 - e, K_4) = 30$. Our technique is based on the recent approach of Angeltveit and McKay and on older algorithms of McKay and Radziszowski. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_02590 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | $R(K_6-e, K_4) = 30$ James, David Kahan, Elisha Rauer, Erik Combinatorics We settle the Ramsey problem $R(K_6 - e, K_4)$, also known as $R(J_6, K_4)$ and $R(K_6^-, K_4)$. Previously, the best bounds were $30 \leq R(K_6 - e, K4) \leq 32$. We prove that $R(K_6 - e, K_4) = 30$. Our technique is based on the recent approach of Angeltveit and McKay and on older algorithms of McKay and Radziszowski. |
| title | $R(K_6-e, K_4) = 30$ |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2402.02590 |