\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 Reza Akhtar, Tao Jiang and Dan Pritikin }
%
%
\medskip
\noindent
%
%
{\bf Edge-Bandwidth of the Triangular Grid}
%
%
\vskip 5mm
\noindent
%
%
%
%
In 1995, Hochberg, McDiarmid, and Saks proved that the
vertex-bandwidth of the triangular grid $T_n$ is precisely $n+1$;
more recently Balogh, Mubayi, and Pluh\'{a}r posed the
problem of determining the edge-bandwidth of $T_n$. We show that
the edge-bandwidth of $T_n$ is bounded above by $3n-1$ and below by
$3n-o(n)$.
\bye