Packing and covering k-chain free subsets in Boolean lattices (Q1043999): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q510490 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: P. G. Boyvalenkov / rank | |||
Normal rank | |||
Revision as of 19:59, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing and covering k-chain free subsets in Boolean lattices |
scientific article |
Statements
Packing and covering k-chain free subsets in Boolean lattices (English)
0 references
10 December 2009
0 references
The hypergraph \(H(B_n)\) is defined whose vertices are the points of the Boolean lattice \(B_n\) and whose edges are inclusionwise maximal \(k\)-chain free subsets of \(B_n\). In the paper under review, the author finds asymptotic bounds for the covering number (the smallest number of vertices intersecting every hyperedge) and the packing number (the greatest number of pairwise disjoint hyperedges) of \(H(B_n)\). Estimations were so far known only for \(k=2\).
0 references
Boolean lattice
0 references
maximal \(k\)-chain free subset
0 references
packing number
0 references
covering number
0 references
