We settle the Ramsey problem \({\mathcal {R}}(K_6-e,K_4)\) , also known as \({\mathcal {R}}(J_6,K_4)\) and \({\mathcal {R}}(K_6^-,K_4)\) . Previously, the best bounds were \(30\le {\mathcal {R}}(K_6-e,K_4) \le 32\) . We prove that \({\mathcal {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.