The effective Linek conjecture for independent sets of trees
Let denote the number of independent sets of a tree . Effective Linek's Problem. Every integer greater than appears as for some tree . This is an effective strengthening of Linek's problem, which asks whether infinitely many positive integers fail to occur as the number of independent sets of a tree. The authors report computational verification through million, but the asserted eventual realization remains open; it contrasts with a conjecture of Han et al. that infinitely many positive integers are not realized by trees.
References
- Swee Hong Chan, Steven Heilman and Greta Panova, “Independent Sets and Continued Fractions”, arXiv:2604.19094 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.