Three color Ramsey number of \(K_ 4-e\) (Q804597)

By \((K_ 4-e)\) we mean the graph obtained by deleting one edge from the complete graph on four vertices. The Ramsey number \(r(K_ 4-e;3)\) is the smallest positive integer n so that, if the edges of \(K_ n\) (the complete graph on n vertices) are colored with three colors, then at least one of the graphs induced by the edge of a single color contains a copy of \((K_ 4-e)\). This paper is devoted to a proof that \(28\leq r(K_ 4-e;3)\leq 32\).