  This work considers new entropy-based proofs of some known, or otherwise
refined, combinatorial bounds for bipartite graphs. These include upper bounds
on the number of the independent sets, lower bounds on the minimal number of
colors in constrained edge coloring, and lower bounds on the number of walks of
a given length in bipartite graphs. The proofs of these combinatorial results
rely on basic properties of the Shannon entropy.
