Greechie diagram; finite orthomodular lattice; maximal Boolean subalgebra
A finite orthomodular lattice in which every maximal Boolean subalgebra (block) has the same cardinality $k$ is called $\lambda$-regular, if each atom is a member of just $\lambda$ blocks. We estimate the minimal number of blocks of $\lambda$-regular orthomodular lattices to be lower than of equal to $\lambda^2$ regardless of $k$.
 M. Navara V. Rogalewicz: The pasting constructions for Orthomodular posets. Submitted for publication.
 V. Rogalewicz: Any orthomodular poset is a pasting of Boolean algebras
. Comment. Math. Univ. Carol. 29 (1988), 557-558. MR 0972837
| Zbl 0659.06006