\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
\nopagenumbers
\noindent
%
%
{\bf M. Borowiecki, I. Schiermeyer, E. Sidorowicz}
%
%
\medskip
\noindent
%
%
{\bf Ramsey ($K_{1,2},K_3$)-Minimal Graphs}
%
%
\vskip 5mm
\noindent
%
%
%
%
For graphs $G,F$ and $H$ we write $G\rightarrow (F,H)$ to mean that if
the edges of $G$ are coloured with two colours, say red and blue, then
the red subgraph contains a copy of $F$ or the blue subgraph contains
a copy of $H$. The graph $G$ is $(F,H)${\it -minimal} ({\it
Ramsey-minimal}) if $G\rightarrow (F,H)$ but $G'\not\rightarrow (F,H)$
for any proper subgraph $G'\subseteq G$. The class of all
$(F,H)$-minimal graphs shall be denoted by $R (F,H)$. In this paper we
will determine the graphs in $R(K_{1,2},K_3)$.

\bye

.
