On the Number of Independent Sets in a Tree

  • Hiu-Fai Law

Abstract

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).

Published
2010-03-22
How to Cite
Law, H.-F. (2010). On the Number of Independent Sets in a Tree. The Electronic Journal of Combinatorics, 17(1), N18. https://doi.org/10.37236/467
Article Number
N18