The planar Ramsey number \(PR(K_4-e,K_5\))
The planar Ramsey number \(PR(H_1,H_2)\) is the smallest integer \(n\) such that any planar graph on \(n\) vertices contains a copy of \(H_1\) or its complement contains a copy of \(H_2\). In the paper it is shown that \(PR(K_4-e,K_5)=14\); thus, \(PR(K_4-e,K_5)<R(K_4-e,K_5)=16\).
scientific article; zbMATH DE number 5121358