Abstract
The aim of the present paper is to carry on the research of Czédli in determining the maximum number of rectangular islands on a rectangular grid. We estimate the maximum of the number of triangular islands on a triangular grid.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Czédli, The number of rectangular islands by means of distributive lattices, European J. Combin., 30 (2009), 208–215.
G. Czédli, On averaging Frankl’s conjecture for large union-closed sets, J. Combin. Theory Ser. A, to appear.
G. Czédli, A. P. Huhn and E. T. Schmidt, Weakly independent subsets in lattices, Algebra Universalis, 20 (1985), 194–196.
G. Czédli, M. Maróti and E. T. Schmidt, On the scope of averaging for Frankl’s conjecture, Order, to appear.
S. Földes and N. M. Singhi, On instantaneous codes, J. Combin., Inform. System Sci., 31 (2006), 317–326.
G. Grätzer, General Lattice Theory, Birkhäuser Verlag, Basel — Stuttgart, 1978.
G. Häartel, An unpublished result on one-dimensional full segments, mentioned by Stephan Földes, Algebra Seminar, University of Szeged, Hungary, May 9, 2007.
G. Pluhár, The number of brick islands by means of distributive lattices, Acta Sci. Math. (Szeged), to appear.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Mária B. Szendrei
Rights and permissions
About this article
Cite this article
Horváth, E.K., Németh, Z. & Pluhár, G. The number of triangular islands on a triangular grid. Period Math Hung 58, 25–34 (2009). https://doi.org/10.1007/s10998-009-9025-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10998-009-9025-7