Saved in:
Bibliographic Details
Main Authors: Chheda, Dev, Goel, Ram, Qiao, Eddie
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2405.18815
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913369807650816
author Chheda, Dev
Goel, Ram
Qiao, Eddie
author_facet Chheda, Dev
Goel, Ram
Qiao, Eddie
contents We review the progress made on bounding the number of independent sets in $d$-regular and irregular graphs over the last 31 years. We particularly focus on contributions from Kahn, Zhao, and Sah et al. in incrementally proving stronger and more general versions of the upper bound. We reproduce the main results of these works, particularly focusing on the unweighted special case (with fugacity $λ= 1$), which allows us to provide more intuitive and clear explanations of the key ideas that have been developed in the field over three decades.
format Preprint
id arxiv_https___arxiv_org_abs_2405_18815
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Number of Independent Sets in Regular and Irregular Graphs: A 31 Year Journey
Chheda, Dev
Goel, Ram
Qiao, Eddie
Combinatorics
We review the progress made on bounding the number of independent sets in $d$-regular and irregular graphs over the last 31 years. We particularly focus on contributions from Kahn, Zhao, and Sah et al. in incrementally proving stronger and more general versions of the upper bound. We reproduce the main results of these works, particularly focusing on the unweighted special case (with fugacity $λ= 1$), which allows us to provide more intuitive and clear explanations of the key ideas that have been developed in the field over three decades.
title Number of Independent Sets in Regular and Irregular Graphs: A 31 Year Journey
topic Combinatorics
url https://arxiv.org/abs/2405.18815