\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 Attila Bern\'ath and Henning Bruhn}
%
%
\medskip
\noindent
%
%
{\bf Degree Constrained Orientations in Countable Graphs  }
%
%
\vskip 5mm
\noindent
%
%
%
%
Degree constrained orientations are orientations of an (undirected) graph
where the in-degree function satisfies given lower and upper bounds.
For finite graphs Frank and Gy\'arf\'as (1976) gave a necessary and
sufficient condition for the existence of such an orientation. We
extend their result to countable graphs.




\bye