Book Ramsey numbers and quasi-randomness

A set of n triangles sharing a common edge is called a book with n pages and is denoted by B-n. It is known that the Ramsey number r(B-n) satisfies r(B-n) = (4 + o(1))n. We show that every red-blue edge colouring of K[(4-epsilon)n] with no monochromatic B-n exhibits quasi-random properties when epsilon tends to 0. This implies that there is a constant c > 0 such that for every red-blue edge colouring of K-r(Bn) there is a monochromatic B-n whose vertices span at least [cn(2)] edges of the same colour as the book. As an application we find the Ramsey number for a class of graphs.