Intersection Inequalities for the Covering Problem

DOI10.1137/0117123MaRDI QIDQ5581649zbMATH OpenOpenAlexFDO

Authors R. G. Stanton, J. G. Kalbfleisch

Publication date 1969

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0117123

zbMATH Keywords

covering problemintersection inequalities

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Recommendations

• More coverings by rook domains
• Linear inequalities for covering codes. II. Triple covering inequalities
• Linear inequalities for covering codes. I. Pair covering inequalities
• New lower bounds for covering codes
• scientific article; zbMATH DE number 3873349

Cited in

(15)

• On the number of ideals of the Niederreiter-Rosenbloom-Tsfasman poset and lower bounds on covering codes
• Covering intersecting bi-set families under matroid constraints
• Tight bounds for Katona's shadow intersection theorem
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• Independent domination in hypercubes
• On covering sets and error-correcting codes
• Generalized minor inequalities for the set covering polyhedron related to circulant matrices
• New results on codes with covering radius 1 and minimum distance 2
• scientific article; zbMATH DE number 4173033 (Why is no real title available?)
• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• An inequality in binary vector spaces
• Hyper-rook Domain Inequalities
• On covering and coloring problems for rook domains
• scientific article; zbMATH DE number 3880735 (Why is no real title available?)
• A new lower bound for the football pool problem for six matches

This page was built for publication: Intersection Inequalities for the Covering Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5581649)