Change search
ReferencesLink to record
Permanent link

Direct link
A note on blockers in posets
KTH, Superseded Departments, Mathematics.ORCID iD: 0000-0002-7497-2764
KTH, Superseded Departments, Mathematics.
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
Abstract [en]

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.
Keyword [en]
antichain, blocker, partition, dominance, refinement, blocking set, Tur an
National Category
URN: urn:nbn:se:kth:diva-82458DOI: 10.1007/s00026-004-0210-xOAI: diva2:498255

QC 20130226

Available from: 2012-02-11 Created: 2012-02-11 Last updated: 2013-02-26Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Björner, AndersHultman, Axel
By organisation
In the same journal
Annals of Combinatorics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 15 hits
ReferencesLink to record
Permanent link

Direct link