Large minimal realizers of a partial order
HTML articles powered by AMS MathViewer
- by Stephen B. Maurer and I. Rabinovitch
- Proc. Amer. Math. Soc. 66 (1977), 211-216
- DOI: https://doi.org/10.1090/S0002-9939-1977-0450144-0
- PDF | Request permission
Abstract:
The size of a minimum realizer of a partial order is called the dimension of that partial order. Here we initiate the study of minimal realizers which are not minimum. As an aid to the study of such realizers, we associate to each minimal realizer certain critical digraphs. We characterize all such critical digraphs for the antichain on n elements, and consequently deduce that for $n \geqslant 4$, the maximum size of a minimal realizer is $[{n^2}/4]$.References
- Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman, The design and analysis of computer algorithms, Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975. Second printing. MR 0413592
- Kenneth P. Bogart, Maximal dimensional partially ordered sets. I. Hiraguchi’s theorem, Discrete Math. 5 (1973), 21–31. MR 318013, DOI 10.1016/0012-365X(73)90024-1
- Horace Komm, On the dimension of partially ordered sets, Amer. J. Math. 70 (1948), 507–520. MR 25541, DOI 10.2307/2372194
- William T. Trotter Jr. and John I. Moore Jr., Some theorems on graphs and posets, Discrete Math. 15 (1976), no. 1, 79–84. MR 416999, DOI 10.1016/0012-365X(76)90111-4 S. Maurer and I. Rabinovitch, Large minimal realizers of a partial order. II (submitted). P. Turan, An extremal problem in graph theory, Math. Lapok. 48 (1941), 536-552.
Bibliographic Information
- © Copyright 1977 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 66 (1977), 211-216
- MSC: Primary 06A10
- DOI: https://doi.org/10.1090/S0002-9939-1977-0450144-0
- MathSciNet review: 0450144