Approximately counting independent sets in bipartite graphs via graph containers

From MaRDI portal
Publication:6074723

DOI10.1002/rsa.21145zbMath1522.05210arXiv2109.03744MaRDI QIDQ6074723

Matthew Jenssen, Will Perkins, Aditya Potukuchi

Publication date: 12 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.03744






Cites Work


This page was built for publication: Approximately counting independent sets in bipartite graphs via graph containers