\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 Drago Bokal, Ga\v{s}per Fijav\v{z} and David R. Wood}
%
%
\medskip
\noindent
%
%
{\bf The Minor Crossing Number of Graphs with an Excluded Minor}
%
%
\vskip 5mm
\noindent
%
%
%
%
The {\em minor crossing number} of a graph $G$ is the minimum crossing
number of a graph that contains $G$ as a minor. It is proved that for
every graph $H$ there is a constant $c$, such that every graph $G$
with no $H$-minor has minor crossing number at most $c|V(G)|$.


\bye

.
