\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Pawe{\l} Pra{\l}at}
%
%
\medskip
\noindent
%
%
{\bf $\overline{\cal R}(3,4)=17$}
%
%
\vskip 5mm
\noindent
%
%
%
%
In this paper, we consider the on-line Ramsey numbers $\overline{\cal R}
(k,l)$ for cliques. Using a high performance computing networks, we
`calculated' that $\overline{\cal R}(3,4)=17$. We also present an
upper bound of $\overline{\cal R}(k,l)$, study its asymptotic
behaviour, and state some open problems.

\bye

.
