On the Number of Independent Sets in a Tree
We show in a simple way that for any $k,m\in{\Bbb N}$, there exists a tree $T$ such that the number of independent sets of $T$ is congruent to $k$ modulo $m$. This resolves a conjecture of Wagner (Almost all trees have an even number of independent sets, Electron. J. Combin. 16 (2009), # R93).
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