On Extremal Set Partitions in Cartesian Product Spaces

DOI10.1017/S0963548300000626MaRDI QIDQ4289289zbMATH OpenOpenAlexFDO

Authors Ning Cai, Rudolf Ahlswede

Publication date 18 August 1994

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548300000626

zbMATH Keywords

Cartesian product spacescovering numberextremal set partitionsGallai's matching theoremlower boundspacking numberShannon's zero error capacity

Mathematics Subject Classification ID

Partitions of sets (05A18) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal set theory (05D05)

Recommendations

• scientific article; zbMATH DE number 1047707
• Parametrized partitions of products of finite sets
• A note on the partition dimension of Cartesian product graphs
• Extremal properties of product sets
• Souslin partitions of products of finite sets
• Extremal sizes of subspace partitions
• scientific article; zbMATH DE number 1025818
• scientific article; zbMATH DE number 6739377
• Partitions and the maximal excludant
• The partition dimension of strong product graphs and Cartesian product graphs

Cites work

• A general 4-words inequality with consequences for 2-way communication complexity
• Hide and Seek, Data Storage, and Entropy
• On the Shannon capacity of a graph

Cited in

(5)

• Decomposing the complete \(r\)-graph
• A simple proof of optimal epsilon nets
• Appendix: On Set Coverings in Cartesian Product Spaces
• Ning Cai: a tribute to a pioneering scholar in information theory
• Partitioning multi-dimensional sets in a small number of ``uniform parts

This page was built for publication: On Extremal Set Partitions in Cartesian Product Spaces

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