Abstract
We develop some new inequalities for the dimension of a finite poset. These inequalities are then used to bound dimension in terms of the maximum size of matchings. We prove that if the dimension of P is d and d=3, then there is a matching of size d in the comparability graph of P. There is no analogue of this result for cover graphs, as we show that there is a poset P of dimension d for which the maximum matching in the cover graph of P has size \(O(\log d)\). On the other hand, there is a dual result in which the role of chains and antichains is reversed, as we show that there is also a matching of size d in the incomparability graph of P. The proof of the result for comparability graphs has elements in common with Perles’ proof of Dilworth’s theorem. Either result has the following theorem of Hiraguchi as an immediate corollary: \(\dim (P)\le |P|/2\) when |P|=4.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bogart, K.P.: Maximal dimensional partially ordered sets I. Hiraguchi’s theorem. Discret. Math. 5, 21–31 (1973)
Bogart, K.P.: Personal communication
Bogart, K.P., Trotter, W.T.: Maximal dimensional partially ordered sets II. Characterization of 2n-element posets with dimension n. Discret. Math. 5, 33–43 (1973)
Bogart, K.P., Trotter, W.T.: Maximal dimensional partially ordered sets III: A characterization of Hiraguchi’s inequality for interval dimension. Discret. Math. 15, 389–400 (1976)
Bogart, K.P., Trotter, W.T.: On the complexity of posets. Discret. Math. 16, 71–82 (1976)
Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 41, 161–166 (1950)
Duffus, D., Sands, B.: On the size of maximal chains and the number of pairwise disjoint maximal antichains. Discret. Math. 310, 2883–2889 (2010)
Dushnik, B., Miller, E.W.: Partially ordered sets. Amer. J. Math. 63, 600–610 (1941)
Felsner, S., Trotter, W.T., Wiechert, V.: The dimension of posets with planar cover graphs. Graphs Combinatorics. to appear
Greene, C.: Some partitions associated with a partially ordered set. J. Comb. Theory, A 20, 69–79 (1976)
Greene, C., Kleitman, D.J.: The structure of Sperner k-families. J. Comb. Theory, A 20, 41–68 (1976)
Hiraguchi, T.: On the dimension of partially ordered sets. Science Reports of the Kanazawa University 1, 77–94 (1951)
Hiraguchi, T.: On the dimension of orders. Science Reports of the Kanazawa University 4, 1–20 (1955)
Howard, D.M., Trotter, W.T.: On the size of maxmimal antichains and the number of pairwise disjoint maximal chains. Discret. Math. 310, 2890–2894 (2010)
Joret, G., Micek, P., Milans, K., Trotter, W.T., Walczak, B., Wang, R.: Tree-width and dimension. Combinatorica. to appear
Kelly, D.: The 3-irreducible partially ordered sets. Can. J. Math. 29, 367–383 (1977)
Kelly, D.: Removable pairs in dimension theory. Order 1, 217–218 (1984)
Kierstead, H.A., Trotter, W.T.: A note on removable pairs. In: Alavi, Y., et al. (eds.) Graph Theory, Combinatorics and Applications, vol. 2, pp. 739–742. Wiley, New York (1991)
Kimble, R.J.: Extremal Problems in Dimension Theory for Partially Ordered Sets, Ph.D. Thesis, Massachusetts Institute of Technology (1973)
Mirsky, L.: A dual of Dilworth’s decomposition theorem. Amer. Math. Monthly 78, 876–877 (1971)
Perles, M.A.: A short proof of Dilworth’s theorem for partially ordered sets. Isr. J. Math. 1, 105–107 (1963)
Reuter, K.: Removing critical pairs. Order 6, 107–118 (1989)
Streib, N., Trotter, W.T.: Dimension and height for posets with planar cover graphs. European J. Combin. 35, 474–489 (2014)
Trotter, W.T.: Irreducible posets with arbitrarily large height exist. J. Comb. Theory, A 17, 337–344 (1974)
Trotter, W.T.: Inequalities in dimension theory for posets. Proc. Amer. Math. Soc. 47, 311–316 (1975)
Trotter, W.T.: A generalization of Hiraguchi’s inequality for posets. J. Comb. Theory, A 20, 114–123 (1976)
Trotter, W.T.: A forbidden subposet characterization of an order dimension inequality. Math. Systems Theory 10, 91–96 (1976)
Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. The Johns Hopkins University Press, Baltimore (1992)
Trotter, W.T.: Partially ordered sets. In: Graham, R.L., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, pp. 433–480. Elsevier, Amsterdam (1995)
Trotter, W.T.: New perspectives on interval graphs and interval orders, interval graphs. In: Bailey, R.A. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 241, pp. 237–286 (1997)
Trotter, W.T., Bogart, K.P.: On the complexity of posets. Discret. Math. 16, 71–82 (1976)
Trotter, W.T., Monroe, T.R.: Combinatorial problems for graphs and matrices. Discret. Math. 39, 87–101 (1982)
Trotter, W.T., Moore, J.I.: Characterization problems for graphs, partially ordered sets, lattices, and families of sets. Discret. Math. 16, 361–381 (1976)
Trotter, W.T., Ross, J.: For t=3, every t-dimensional partial order can be embedded in a (t+1)-irreducible partial order. In: Hajnal, A., Lovász, L., Sós, V.T. (eds.) Finite and Infinite Sets. Colloq. Math. Soc. J. Bolyai, vol. 37, pp. 711–732 (1984)
