Skip to main content

On An Extremal Property of Antichains in Partial Orders. The Lym Property and Some of Its Implications and Applications

  • Conference paper
Combinatorics

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 16))

Abstract

Let F be a collection of subsets of an n element set S, such that no member of F contains another. We call such a collection an antichain, in contrast to a collection that is totally ordered by inclusion which one usually calls a chain.

Supported in part by ONR Contract N00014-67-A-0204-0063.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson, I., On the divisors of a number, J. London Math. Soc., 43 (1968) 410–418.

    Article  MathSciNet  MATH  Google Scholar 

  2. Dilworth, R.P. & Curtis Greene, A counterexample to the generalization of Sperner’s theorem, J. Combinatorial Theory, 10 (1971) 18–21.

    Article  MathSciNet  MATH  Google Scholar 

  3. Erdös, P., On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc., 51 (1945) 898–902.

    Article  MathSciNet  MATH  Google Scholar 

  4. Graham, R. & L. Harper, Some results on matching in bipartite graphs, preprint, 1968.

    Google Scholar 

  5. Hsieh, W.N. & D. Kleitman, Normalized matching in the direct product of partial orders, preprint.

    Google Scholar 

  6. Katona, G., On a conjecture of Erdös and a stronger form of Sperner’s theorem, Studies Su. Math. Hungar., 1 (1966) 59–63.

    MathSciNet  MATH  Google Scholar 

  7. Katona, G., A generalization of some generalizations of Sperner’s theorem, J. Combinatorial Theory B, 12 (1972) 72–81.

    Article  MathSciNet  MATH  Google Scholar 

  8. Katona, G., Families of subsets having no subset containing another with small difference, Nieuw Arch. Wisk., (3), 20 (1972) 54–67.

    MathSciNet  MATH  Google Scholar 

  9. Katona, G., Numbers of vectors in a circle of radius \( \sqrt {2} \), Akademiai Kiado, Budapest, Hungary, 1969.

    Google Scholar 

  10. Katona, G., A simple proof of the Erdös-Ko-Rado theorem, J. Combinatorial Theory B, 13 (1972) 183–184.

    Article  MathSciNet  MATH  Google Scholar 

  11. Kleitman, D., M. Edelberg & D. Lubell, Maximal sized antichains in partial orders, J. Discrete Math., 1 (1971) 47–53.

    Article  MathSciNet  MATH  Google Scholar 

  12. Kleitman, D., Maximal number of subsets of a finite set no k of which are pairwise disjoint, J. Combinatorial Theory, 5 (1968) 157–164.

    Article  MathSciNet  MATH  Google Scholar 

  13. Kleitman, D., On a lemma of Littlewood and Offord in the distribution of certain sums, Math. Z., 90 (1968) 251–259.

    Article  MathSciNet  Google Scholar 

  14. Kleitman, D., How many sums of vectors can be in a circle of diameter \( \sqrt {2} \), Advances in Math., 9 (1972) 296.

    Article  MathSciNet  MATH  Google Scholar 

  15. Kleitman, D., On a lemma of Littlewood and Offord on the distribution of linear combinations of vectors, Advances in Math., 5 (1970) 115–117.

    Article  MathSciNet  Google Scholar 

  16. Levine, E. & D. Lubell, Sperner collections on sets of real variables, Annals N.Y. Acad. Sciences, 75 (1970) 172–176.

    Google Scholar 

  17. Lubell, D., A short proof of Sperner’s lemmas, J. Combinatorial Theory, 1 (1966) 299.

    Article  MathSciNet  MATH  Google Scholar 

  18. Meshalkin, L.D., A generalization of Sperner’s theorem on the number of subsets of a finite set, Theory Probability Appl., 8 (1963) 203–204.

    Article  MATH  Google Scholar 

  19. Sperner, E.S., Ein Satz über Untermengen einer endlichen Menge, Math. Z., 27 (1928) 544–548.

    Article  MathSciNet  MATH  Google Scholar 

  20. Yamamoto, K., Logarithmic order of free distributive lattices, J. Math. Soc. Japan, 6 (1954) 343–353.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. Hall Jr. J. H. van Lint

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Mathematical Centre, Amsterdam

About this paper

Cite this paper

Kleitman, D.J. (1975). On An Extremal Property of Antichains in Partial Orders. The Lym Property and Some of Its Implications and Applications. In: Hall, M., van Lint, J.H. (eds) Combinatorics. NATO Advanced Study Institutes Series, vol 16. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-1826-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-94-010-1826-5_14

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-1828-9

  • Online ISBN: 978-94-010-1826-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics