A note on blockers in posets
2004 (English)In: Annals of Combinatorics, ISSN 0218-0006, E-ISSN 0219-3094, Vol. 8, no 2, 123-131 p.Article in journal (Refereed) Published
The blocker A* of an antichain A in a finite poset P is the set of elements minimal with the property of having with each member of A a common predecessor. The following is done: (1) The posets P for which A** = A for all antichains are characterized.(2) The blocker A* of a symmetric antichain in the partition lattice is characterized.(3) Connections with the question of finding minimal size blocking sets for certain set families are discussed.
Place, publisher, year, edition, pages
2004. Vol. 8, no 2, 123-131 p.
antichain, blocker, partition, dominance, refinement, blocking set, Tur an
IdentifiersURN: urn:nbn:se:kth:diva-82458DOI: 10.1007/s00026-004-0210-xOAI: oai:DiVA.org:kth-82458DiVA: diva2:498255
QC 201302262012-02-112012-02-112013-02-26Bibliographically approved