Edge-Bandwidth of the Triangular Grid

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).

• Type: Journal
• Year: 2007
• Where: COMBINATORICS
• Authors: Reza Akhtar, Tao Jiang, Dan Pritikin
• Keywords: COMBINATORICS 2007, Grid, McDiarmid, Triangular Grid Tn