On the number of independent sets in a tree (Q976671)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of independent sets in a tree |
scientific article; zbMATH DE number 5721427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of independent sets in a tree |
scientific article; zbMATH DE number 5721427 |
Statements
On the number of independent sets in a tree (English)
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
0.96615946
0 references
0.95483464
0 references
0.95271665
0 references
0 references
0.9509419
0 references
0 references
0.9463762
0 references
