Almost all trees have an even number of independent sets (Q2380249): Difference between revisions

Summary: This paper is devoted to the proof of the surprising fact that almost all trees have an even number of independent vertex subsets (in the sense that the proportion of those trees with an odd number of independent sets tends to 0 as the number of vertices approaches \(\infty \)) and to its generalisation to other moduli: for fixed \(m\), the probability that a randomly chosen tree on \(n\) vertices has a number of independent subsets that is divisible by \(m\) tends to 1 as \(n \rightarrow \infty \).