$R(K_6-e, K_4) = 30$
Combinatorics
2025-04-09 v2
Abstract
We settle the Ramsey problem , also known as and . Previously, the best bounds were . We prove that . Our technique is based on the recent approach of Angeltveit and McKay and on older algorithms of McKay and Radziszowski.
Keywords
Cite
@article{arxiv.2402.02590,
title = {$R(K_6-e, K_4) = 30$},
author = {David James and Elisha Kahan and Erik Rauer},
journal= {arXiv preprint arXiv:2402.02590},
year = {2025}
}