Interval Packing and Covering in the Boolean Lattice
From MaRDI portal
Publication:2785370
DOI10.1017/S0963548300002121zbMath0868.05036OpenAlexW2006109052MaRDI QIDQ2785370
Publication date: 18 August 1997
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300002121
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07) Lattice packing and covering (number-theoretic aspects) (11H31) Combinatorial aspects of packing and covering (05B40)
Related Items (15)
The order-interval hypergraph of a finite poset and the König property ⋮ A note on the uniqueness of \((w, r)\) cover-free codes ⋮ Generalized cover-free families. ⋮ Uniqueness of some optimal superimposed codes ⋮ Some new bounds for cover-free families ⋮ An upper bound of the number of tests in pooling designs for the error-tolerant complex model ⋮ Cover-free codes and separating system codes ⋮ An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution ⋮ Bounds on the rate of separating codes ⋮ Some new bounds for cover-free families through biclique covers ⋮ Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others ⋮ Bounds on the rate of disjunctive codes ⋮ Some new results on superimposed codes ⋮ On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset ⋮ On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of the finite poset
Cites Work
- Inequalities for two set systems with prescribed intersections
- Constructions of ranked posets
- Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices. I
- On the ratio of optimal integral and fractional covers
- Interval stability and interval covering property in finite posets
- Perfect Hashing and Probability
- On generalized graphs
This page was built for publication: Interval Packing and Covering in the Boolean Lattice
