Approximately counting independent sets in bipartite graphs via graph containers

Matthew Jenssen, Aditya Potukuchi, Will Perkins. Approximately counting independent sets in bipartite graphs via graph containers. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 499-516, SIAM, 2022. [doi]

Abstract

Abstract is missing.