  For graphs $G$ and $H$, let $G\to H$ signify that any red/blue edge coloring
of $G$ contains a monochromatic $H$. Let $G(N,p)$ be the random graph of order
$N$ and edge probability $p$. The sharp thresholds for Ramsey properties seemed
out of hand until a general technique was introduced by Friedgut ({\em J. AMS}
12 (1999), 1017--1054). In this paper, we obtain the sharp Ramsey threshold for
the book graph $B_n^{(k)}$, which consists of $n$ copies of $K_{k+1}$ all
sharing a common $K_k$. In particular, for every fixed integer $k\ge 1$ and for
any real $c>1$, let $N=c2^k n$. Then for any real $\gamma>0$, \[ \lim_{n\to
\infty} \Pr(G(N,p)\to B_n^{(k)})= \left\{ \begin{array}{cl} 0 & \mbox{if
$p\le\frac{1}{c^{1/k}}(1-\gamma)$,} \\ 1 & \mbox{if
$p\ge\frac{1}{c^{1/k}}(1+\gamma)$}. \end{array} \right. \] The sharp Ramsey
threshold $\frac{1}{c^{1/k}}$ for $B_n^{(k)}$, e.g. a star, is positive
although its edge density tends to zero.
