Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs

Igal Sason

doi:https://doi.org/10.1109/ISIT45174.2021.9518068

Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs

Igal Sason

Electrical and Computer Engineering

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
Pages	3225-3230
Number of pages	6
ISBN (Electronic)	9781538682098
DOIs	https://doi.org/10.1109/ISIT45174.2021.9518068
State	Published - 12 Jul 2021
Event	2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia Duration: 12 Jul 2021 → 20 Jul 2021

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2021-July

Conference

Conference	2021 IEEE International Symposium on Information Theory, ISIT 2021
Country/Territory	Australia
City	Virtual, Melbourne
Period	12/07/21 → 20/07/21

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

https://doi.org/10.1109/ISIT45174.2021.9518068

Cite this

@inproceedings{4abfc832ed23403f970cf735e145cfa2,

title = "Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs",

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.",

author = "Igal Sason",

note = "Publisher Copyright: {\textcopyright} 2021 IEEE.; 2021 IEEE International Symposium on Information Theory, ISIT 2021 ; Conference date: 12-07-2021 Through 20-07-2021",

year = "2021",

month = jul,

day = "12",

doi = "https://doi.org/10.1109/ISIT45174.2021.9518068",

language = "الإنجليزيّة",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "3225--3230",

booktitle = "2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings",

}

Sason, I 2021, Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs. in 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings. IEEE International Symposium on Information Theory - Proceedings, vol. 2021-July, pp. 3225-3230, 2021 IEEE International Symposium on Information Theory, ISIT 2021, Virtual, Melbourne, Australia, 12/07/21. https://doi.org/10.1109/ISIT45174.2021.9518068

Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs. / Sason, Igal.
2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings. 2021. p. 3225-3230 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2021-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs

AU - Sason, Igal

PY - 2021/7/12

Y1 - 2021/7/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85115047181&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/ISIT45174.2021.9518068

DO - https://doi.org/10.1109/ISIT45174.2021.9518068

M3 - منشور من مؤتمر

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 3225

EP - 3230

BT - 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings

T2 - 2021 IEEE International Symposium on Information Theory, ISIT 2021

Y2 - 12 July 2021 through 20 July 2021

ER -

Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this