  We prove a conjecture by Brown, Dilcher and Manna on the asymptotic behavior
of sparse binomial-type polynomials arising naturally in a graph theoretical
context in connection with the expected number of independent sets of a graph.
