A splitting property of maximal antichains


In anydense posetP (and in any Boolean lattice in particular) every maximal antichainS may be partitioned into disjoint subsetsS 1 andS 2, such that the union of the downset ofS 1 with the upset ofS 2 yields the entire poset:D(S 1) ∪U (S 2) =P. To find a similar splitting of maximal antichains in posets is NP-hard in general.

This is a preview of subscription content, access via your institution.


  1. [1]

    U. Faigle: Personal communication, (1993).

  2. [2]

    M. Garey, D. Johnson:Computers and Intractability A Guide to the Theory of NP-Completeness, Freeman, New York (1979).

    Google Scholar 

Download references

Author information



Additional information

Research was partially carried out when the second author visited the first author in Bielefeld and it was partially supported by OTKA grant T016358

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ahlswede, R., Erdős, P.L. & Graham, N. A splitting property of maximal antichains. Combinatorica 15, 475–480 (1995). https://doi.org/10.1007/BF01192520

Download citation

Mathematics Subject Classification (1991)

  • 05 D 05
  • 06 A 07