Relative blocking in posets
From MaRDI portal
Publication:2467569
Abstract: Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded posets are considered and those related to the Boolean lattices are explored; it is shown that such sequences inherit all the familiar properties of the Farey sequences.
Recommendations
Cites work
- A note on blockers in posets
- A note on operators of deletion and contraction for antichains
- Clutters and matroids
- Combinatorial optimization. Packing and covering
- Combinatorics and commutative algebra.
- Extended blocker, deletion, and contraction maps on antichains
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Geometric algorithms and combinatorial optimization.
- scientific article; zbMATH DE number 3645097 (Why is no real title available?)
- scientific article; zbMATH DE number 1194481 (Why is no real title available?)
- scientific article; zbMATH DE number 42573 (Why is no real title available?)
- scientific article; zbMATH DE number 52944 (Why is no real title available?)
- scientific article; zbMATH DE number 53152 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 1182908 (Why is no real title available?)
- scientific article; zbMATH DE number 863503 (Why is no real title available?)
- scientific article; zbMATH DE number 273025 (Why is no real title available?)
- scientific article; zbMATH DE number 3332515 (Why is no real title available?)
- scientific article; zbMATH DE number 5181446 (Why is no real title available?)
- Matchings and covers in hypergraphs
- Note on a combinatorial application of Alexander duality
- On blockers in bounded posets
- On the number of linear partitions of the (m,n)-grid
- Quorum systems constructed from combinatorial designs
- SUBSPACE ARRANGEMENTS DEFINED BY PRODUCTS OF LINEAR FORMS
- The Load, Capacity, and Availability of Quorum Systems
- Voting fairly: Transitive maximal intersecting families of sets
Cited in
(2)
This page was built for publication: Relative blocking in posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467569)