Skip to main content
SpringerLink
Log in

Antichain sequences

  • Published:
Order Aims and scope Submit manuscript

Abstract

For any finite partially ordered set S we display a dual transportation system of linear inequalities, and a bijection A(x) from the maximal integer-valued solutions x of this system onto the ‘maximal sequences’ of k antichains in S. This provides a simple translation to a dual transportation problem of the problem: find a maximum weight union of k antichains.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A.Berenguer, J.Diaz, H.Harper (1982) A solution of the Sperner-Erdös problem, Theoretical Computer Science 21, 99–103.

    Google Scholar 

  2. K. Cameron (1982) Polyhedral and algorithmic ramifications of antichains, PhD thesis, University of Waterloo.

  3. K.Cameron and J.EDmonds (1979) Algorithms for optimum antichains. in Proc. 10th S.-E. Conf. Combinatorics, Graph Theory and Computing (ed. F.Hoffman et al.), Utilitas Mathematica, Winnipeg, pp. 229–240.

    Google Scholar 

  4. K. Cameron and J. Edmonds. Coflow polyhedra.

  5. G. B.Dantzig and A. J.Hoffman (1956) Dilworth's theorem on partially ordered sets, in Linear Inequalities and Related Systems, Annals of Mathematics Study 38, (ed. H. W.Kuhn et al.), Princeton University Press, New Jersey, pp. 207–214.

    Google Scholar 

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

    Google Scholar 

  7. J.Edmonds and R. M.Karp (1969) Theoretical improvements in algorithmic efficiency for network flow problems, in Proc. of the Calgary International Conf. on Comb. Structures and their Appls. (ed. R.Guy et al.), Gordon and Breach, New York, 93–96; J. ACM 19 (1972), 248–265.

    Google Scholar 

  8. L. R.FordJr. and D. R.Fulkerson (1962) Flows in Networks, Princeton Univ. Press, Princeton, New Jersey.

    Google Scholar 

  9. A.Frank (1980) On chain and antichain families of a partially ordered set, J. Combin. Theory (B) 29, 176–184.

    Google Scholar 

  10. D. R.Fulkerson (1956) Note on Dilworth's decomposition theorem for partially ordered sets, Proc. Amer. Math. Soc. 7, 701–702.

    Google Scholar 

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

    Google Scholar 

  12. A. J.Hoffman and D. E.Schwartz (1977) On partitions of a partially ordered set, J. Combin. Theory (B) 23, 3–13.

    Google Scholar 

  13. M.Saks (1979) A short proof of the existence of k-saturated partitions of partially ordered sets, Adv. Math. 33, 207–211.

    Google Scholar 

  14. M. Saks (1980) Duality properties of finite set-systems, PhD thesis, MIT.

  15. E. Tardos. A strongly polynomial minimum cost circulation algorithm.

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Kathie Cameron

Authors
  1. Kathie Cameron
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by I. Rival

Research supported by the Natural Sciences and Engineering Research of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cameron, K. Antichain sequences. Order 2, 249–255 (1985). https://doi.org/10.1007/BF00333130

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00333130

AMS (MOS) subject classfications (1980)

Key words

Search

Navigation