Entropy and counting

Abstract

We illustrate the role of information theoretic ideas in combinatorial problems, some of them arising in computer science. We also consider the problem of covering graphs using other graphs, and show how information theoretic ideas are applied to this setting. Our treatment of graph covering problems naturally motivates two (already known) definitions of K ̈orner’s graph entropy.