Approximately counting independent sets in bipartite graphs via graph containers

Matthew Jenssen, Will Perkins, Aditya Potukuchi

Research output: Working paper/Preprint › Preprint

87 Downloads (Pure)

Keywords

@techreport{a066e358e6914d81a0d2570085f08242,

title = "Approximately counting independent sets in bipartite graphs via graph containers",

keywords = "cs.DS, math.CO",

author = "Matthew Jenssen and Will Perkins and Aditya Potukuchi",

year = "2021",

month = sep,

day = "8",

doi = "10.48550/arXiv.2109.03744",

language = "English",

publisher = "arXiv",

type = "WorkingPaper",

institution = "arXiv",

}

TY - UNPB

T1 - Approximately counting independent sets in bipartite graphs via graph containers

AU - Jenssen, Matthew

AU - Perkins, Will

AU - Potukuchi, Aditya

PY - 2021/9/8

Y1 - 2021/9/8

KW - cs.DS

KW - math.CO

U2 - 10.48550/arXiv.2109.03744

DO - 10.48550/arXiv.2109.03744

M3 - Preprint

BT - Approximately counting independent sets in bipartite graphs via graph containers

PB - arXiv

ER -