Abstract
This paper is devoted to the proof of the surprising fact that almost all trees have an even number of independent vertex subsets (in the sense that the proportion of those trees with an odd number of independent sets tends to $0$ as the number of vertices approaches $\infty$) and to its generalisation to other moduli: for fixed $m$, the probability that a randomly chosen tree on $n$ vertices has a number of independent subsets that is divisible by $m$ tends to $1$ as $n \to \infty$.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献