Combinatorial Applications of the Shearer and Han Inequalities in Graph Theory and Boolean Functions

Watch a 56-minute mathematics lecture from the Hausdorff Center that explores the combinatorial applications of Shearer's and Han's inequalities in information theory. Discover various formulations of these fundamental inequalities and their powerful applications across graph theory, Boolean functions, and lattice problems. Learn how these information-theoretic tools can be effectively utilized to solve complex combinatorial problems, providing valuable insights into the intersection of information theory and discrete mathematics.