On the number of independent sets in a tree (Q976671): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Import IPFS CIDs |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreid4fuxq4anxqpqcijbgw677zglwztylvkrcsqwszxhjwy5r5qqx4u / rank | |||
Normal rank | |||
Latest revision as of 11:26, 22 February 2025
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
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
