Edge-bandwidth of the triangular grid (Q1010627): Difference between revisions

Summary: In 1995, \textit{R. Hochberg}, \textit{C. McDiarmid}, and {it M. Saks} [Discrete Math. 138, No.\,1-3, 261--265 (1995; Zbl 0823.05048)] proved that the vertex-bandwidth of the triangular grid \(T_n\) is precisely \(n+1\); more recently \textit{J. Balogh}, \textit{D. Mubayi}, and \textit{A. Pluhár} [Theor. Comput. Sci. 359, No.\,1-3, 43--57 (2006; Zbl 1098.05070)] 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)\).