Partitioning multi-dimensional sets in a small number of ``uniform parts

DOI10.1016/j.ejc.2005.08.002zbMath1106.94012OpenAlexW2050280202WikidataQ57349768 ScholiaQ57349768MaRDI QIDQ854815

Ilan Newman, Alexander Shen, Gábor Tardos, Nikolai K. Vereshchagin, Noga Alon

Publication date: 7 December 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.08.002

zbMATH Keywords

bipartite graphsinformation inequalities for Shannon entropy

Mathematics Subject Classification ID

Applications of graph theory (05C90) Partitions of sets (05A18) Combinatorial aspects of partitions of integers (05A17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Measures of information, entropy (94A17)

Related Items (2)

It's all a matter of degree. Using degree information to optimize multiway joins ⋮ Kolmogorov Complexity as a Language

Cites Work

• A combinatorial approach to information inequalities
• A new class of non-Shannon-type inequalities for entropies
• On characterization of entropy function via information inequalities
• Combinatorial interpretation of Kolmogorov complexity

This page was built for publication: Partitioning multi-dimensional sets in a small number of ``uniform parts