On Extremal Set Partitions in Cartesian Product Spaces

DOI10.1017/S0963548300000626zbMath0794.05126OpenAlexW2094306577MaRDI QIDQ4289289

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

lower boundspacking numbercovering numberCartesian product spacesextremal set partitionsGallai's matching theoremShannon's zero error capacity

Mathematics Subject Classification ID

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

Related Items

Decomposing the complete \(r\)-graph

Cites Work

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