Li–Li–Wang constructibility conjecture for independent-set numbers of trees
Statement
A positive integer is constructible on trees if there exists a tree such that , where denotes the number of independent sets in . Li–Li–Wang's conjecture. There are only finitely many positive integers that are not constructible on trees. This conjecture concerns which integers occur as independent-set numbers of trees; the paper states that it is attributed to Li, Li, and Wang and studies it through an algorithm providing evidence for the assertion.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.