Abstract
We study the structures of orthoposets forced bya combination of an extremum principle (maximum numberof comparable pairs or of edges in the Hasse diagram)and an excluded substructure information. We show that in all interesting cases this reducesat least asymptotically to the corresponding graphproblems, and we give the solution to some of theseproblems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Brass, P. (1995). Symmetric chain partitions of orthocomplemented posets, International Journal of Theoretical Physics, 34, 1241–1245.
Dilworth, R. P. (1950). A decomposition theorem for partially ordered sets, Annals of Mathematics, 51, 161–166.
Flachsmeyer, J. (1988). Orthoposets as substructures of Boolean algebras, Topology and Measure V (Binz/GDR 1987), Wiss. Beitr. Ernst-Moritz-Arndt-Universitaät Greifswald, pp. 89–94.
Füredi, Z. (1996). On the number of edges of quadrilateral-free graphs, Journal of Combinatorial Theory Series B, 68, 1–6.
Simonovits, M. (1983). Extremal graph theory, in Selected Topics in Graph Theory 2, L. W. Beineke and R. J. Wilson, eds., Academic Press, pp. 161–200.
Rights and permissions
About this article
Cite this article
Brass, P. On Extremal Orthoposets Without Forbidden Substructures. International Journal of Theoretical Physics 37, 3–9 (1998). https://doi.org/10.1023/A:1026644702154
Issue Date:
DOI: https://doi.org/10.1023/A:1026644702154