Skip to main content
Log in

Duality for Semiantichains and Unichain Coverings in Products of Special Posets

  • Published:
Order Aims and scope Submit manuscript

Abstract

Saks and West conjectured that for every product of partial orders, the maximum size of a semiantichain equals the minimum number of unichains needed to cover the product. We prove the case where both factors have width 2. We also use the characterization of product graphs that are perfect to prove other special cases, including the case where both factors have height 2. Finally, we make some observations about the case where both factors have dimension 2.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chappell, G.G.: Optimization in product of combinatorial structures. Ph.D. Thesis, University of Illinois (1996)

  2. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164(2), 51–229 (2006)

    MATH  MathSciNet  Google Scholar 

  3. de Werra, D., Hertz, A.: On perfectness of sums of graphs. Discrete Math. 195, 93–101 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(2), 161–166 (1950)

    Article  MathSciNet  Google Scholar 

  5. Dushnik, B., Miller, E.W.: Partially ordered sets. Am. J. Math. 63, 600–610 (1941)

    Article  MathSciNet  Google Scholar 

  6. Greene, C.: Some partitions associated with a partially ordered set. J. Combin. Theory A 20, 69–79 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  7. Greene, C., Kleitman, D.J.: The structure of Sperner k-families. J. Combin. Theory A 20, 41–68 (1976)

    Article  MathSciNet  Google Scholar 

  8. Hiraguchi, T.: On the dimension of orders. Sci. Rep. Kanazawa Univ. 4, 1–20 (1955)

    MathSciNet  Google Scholar 

  9. Lovász, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2, 253–267 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  10. Olariu, S.: Paw-free graphs. Inf. Process. Lett. 28, 53–54 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ravindra, G., Parthasarathy, K.R.: Perfect product graphs. Discrete Math. 20, 177–186 (1977/78)

    Article  MathSciNet  Google Scholar 

  12. Tovey, C.A., West, D.B.: Networks and chain coverings in partial orders and their products. Order 2, 49–60 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  13. West, D.B.: Unichain coverings in partial orders with the nested saturation property (Special issue: ordered sets, Oberwolfach, 1985). Discrete Math. 63, 297–303 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. West, D.B., Tovey, C.A.: Semiantichains and unichain coverings in direct products of partial orders. SIAM J. Algebr. Discrete Methods 2, 295–305 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  15. Wu, C.: On relationships between semi-antichains and unichain coverings in discrete mathematics. Chin. Q. J. Math. 13, 44–48 (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Douglas B. West.

Additional information

Work supported in part by NSA Award No. H98230-06-1-0065.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, Q., West, D.B. Duality for Semiantichains and Unichain Coverings in Products of Special Posets. Order 25, 359–367 (2008). https://doi.org/10.1007/s11083-008-9099-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-008-9099-z

Keywords

Navigation