The number of triangular islands on a triangular grid

From MaRDI portal





Using lattice theory, \textit{G.~Czédli} [Eur. J. Comb. 30, No 1, 208--215 (2009; Zbl 1187.05024)] has obtained a sharp upper bound for the number of rectangular islands. His methods are applied in the paper under review to estimate the number \(f(n)\) of triangular islands on a triangular grid with the side length \(n\): \((n^2 + 3n)/5 \leq f(n) \leq (3n^2 + 9n + 2)/14\). The lower bound is obtained by induction on \(n\), using explicit constructions.











This page was built for publication: The number of triangular islands on a triangular grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046809)