Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs
Information Theory
2021-06-15 v1 Combinatorics
math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.2106.07336,
title = {Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs},
author = {Igal Sason},
journal= {arXiv preprint arXiv:2106.07336},
year = {2021}
}
Comments
To appear in the Proceedings of 2021 IEEE International Symposium on Information Theory, July 12-20, 2021 (virtual symposium). arXiv admin note: text overlap with arXiv:2012.12107