Revision as of 13:49, 14 February 2022 edit 18.31.14.234 (talk) No edit summary ← Previous edit		Revision as of 13:50, 14 February 2022 edit undo Nmath2 (talk \| contribs) 30 edits No edit summary Next edit →
Line 37: ==Graph container algorithm== We first describe a method for showing strong upper bounds on the number of independent sets in a graph; this exposition adapted from a survey of Samotij<ref>{{cite journal \|last1=Samotij \|first1= Wojciech \|title=Counting independent sets in graphs \|journal=European Journal of Combinatorics \|date=2015 \|volume=48 \|pages=5–18\|doi= 10.1016/j.ejc.2015.02.005 \|s2cid= 15850625 }}</ref> about the graph container method, originally employed by Kleitman-Winston and Sapozhenko. ===Notation===

Container method: Difference between revisions