Skip to main content
SpringerLink
Log in

A minimal cutset of the boolean lattice with almost all members

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Two almost explicit constructions are given satisfying the title.

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. Füredi, Z., Kahn, J., Kleitman, D.J.: Sphere coverings of the hypercube with incomparable centers. Discrete Math. (to appear)

  2. Ginsburg, J., Rival, I., Sands, B.: Antichains and finite sets that meet all maximal chains, (to appear)

  3. Kostochka, A.V.: Maximum order of the boundary of a filter in ann-dimensional cube (in Russian), Metody Discretn. Anal.41, 49–61, 109 (1984) MR 87g:05022

    Google Scholar 

  4. Lih, Ko-Wei: Problems in finite extremal set theory. In: Designs and finite geometries (Kyoto, 1986), Sûrikaisekikenkyûsho Kôkyûroku607, 1–4 (1987)

    Google Scholar 

  5. Nowakowski, R.: Cutsets of Boolean lattices (preprint)

  6. Rényi, A.: Probability Theory. Amsterdam: North-Holland 1970

    Google Scholar 

  7. Sauer, N., Woodrow, R.: Finite cutsets and finite antichains. Order1, 35–46 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, P.O.B. 127, 1364, Budapest, Hungary

    Zoltán Füredi

  2. Mathematics Department, University of South Carolina, 29208, Columbia, SC, USA

    Jerrold R. Griggs

  3. Department of Mathematics, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA

    Daniel J. Kleitman

Authors
  1. Zoltán Füredi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jerrold R. Griggs
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel J. Kleitman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was done while the authors visited the Institute for Mathematics and its Applications at the University of Minnesota, Minneapolis, MN 55455.

Research supported in part by Hungarian National Foundation for Scientific Research, grant no. 1812.

Research supported in part by NSF Grant MDS 87-01475.

Research supported in part by NSF grant DMS 86-06225 and Airforce Grant OSR-86-0076.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Füredi, Z., Griggs, J.R. & Kleitman, D.J. A minimal cutset of the boolean lattice with almost all members. Graphs and Combinatorics 5, 327–332 (1989). https://doi.org/10.1007/BF01788687

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation