| | |
Summary: Edge-bandwidth of the triangular grid
Reza Akhtar
Dept. of Mathematics and Statistics
Miami University, Oxford, OH 45056, USA
reza@calico.mth.muohio.edu
Tao Jiang
Dept. of Mathematics and Statistics
Miami University, Oxford, OH 45056, USA
jiangt@muohio.edu
Dan Pritikin
Dept. of Mathematics and Statistics
Miami University, Oxford, OH 45056, USA
pritikd@muohio.edu
Submitted: May 19, 2006; Accepted: Aug 16, 2007; Published: Oct 5, 2007
Mathematics Subject Classification: 05C78
Abstract
In 1995, Hochberg, McDiarmid, and Saks proved that the vertex-bandwidth of
the triangular grid Tn is precisely n + 1; more recently Balogh, Mubayi, and Pluh´ar
posed the problem of determining the edge-bandwidth of Tn. We show that the
edge-bandwidth of Tn is bounded above by 3n - 1 and below by 3n - o(n).
|
