ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A positive integer nn is constructible on trees if there exists a tree TT such that i(T)=ni(T)=n, where i(T)i(T) denotes the number of independent sets in TT. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.