A note on blockers in posets
| dc.creator | Björner, Anders | |
| dc.creator | Hultman, Axel | |
| dc.date | 2004-03-04 | |
| dc.date.accessioned | 2026-07-07T05:06:07Z | |
| dc.date.available | 2026-07-07T05:06:07Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/0403094 | |
| dc.identifier | http://arxiv.org/abs/math/0403094 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/70362 | |
| dc.subject | Combinatorics | |
| dc.title | A note on blockers in posets | |
| dc.type | text |