On the number of independent sets in a tree (Q976671)

From MaRDI portal
Revision as of 01:47, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the number of independent sets in a tree
scientific article

    Statements

    On the number of independent sets in a tree (English)
    0 references
    0 references
    16 June 2010
    0 references
    Summary: We show in a simple way that for any \(k, m \in \mathbb 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 \textit{S. G. Wagner} [Electron. J. Comb. 16, No. 1, Research Paper R93, 10 p. (2009; Zbl 1230.05165)].
    0 references

    Identifiers