Linek's 1989 problem asks whether the numbers of independent sets of trees avoid infinitely many positive integers. We show that the set of natural numbers realized as the number of independent sets of a tree has a lower growth exponent of $0.1966$. We further prove that the set of positive integers representable by connected planar graphs has asymptotic density one. Lastly, we establish a phase transition: the number of independent sets of graphs with fewer than $d|V|$ edges for any $d<1$ is contained in a set of density zero, whereas, following Shkredov's recent breakthrough on Zaremba's conjecture in continued fraction theory, there exists a constant $D$ such that the number of independent sets of graphs with at most $D|V|$ edges covers all positive integers.