Almost All Trees have an Even Number of Independent Sets
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 \to \infty$.
1988 ◽
Vol 129
◽
pp. 331-332
Keyword(s):
1977 ◽
Vol 35
◽
pp. 590-591
Keyword(s):
1983 ◽
Vol 41
◽
pp. 70-71
1977 ◽
Vol 35
◽
pp. 68-69
Keyword(s):
1976 ◽
Vol 34
◽
pp. 218-219
Keyword(s):
1985 ◽
Vol 43
◽
pp. 348-349
1990 ◽
Vol 48
(3)
◽
pp. 14-15