A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence densities include a broad family of densities over graphs and relational structures, such as F-free densities of graphs for a given graph F. In the case of k-uniform hypergraphs, we prove that the independence density is always rational. In the case of finite but unbounded hyperedges, we show that the independence density can be any realarXiv:1308.2837v1 fatcat:cidyv45qejgwtbugpkrkn5id2e