Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs

Paul Balister, Béla Bollobás, Karen Gunderson

The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be gener…