The planar Linek conjecture for independent sets
Statement
Let denote the number of independent sets of a connected planar graph . Planar Linek's Problem. Every positive integer is equal to for some connected planar graph . The conjecture strengthens the proved result that almost every positive integer is realized by a connected planar graph. Computation supports it by realizing the values missing from the cited tree computation, but the assertion for every positive integer remains open.
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.