On the Number of Independent Sets in a Tree

Hiu-Fai Law

Source record

Source: Crossref

Published: Mar 22, 2010

DOI: 10.37236/467

Open original source ↗

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

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

On the Number of Independent Sets in a Tree — Mathematical Frontier Network