ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let i(P)i(P) denote the number of independent sets of a connected planar graph PP. Planar Linek's Problem. Every positive integer is equal to i(P)i(P) for some connected planar graph PP. The conjecture strengthens the proved result that almost every positive integer is realized by a connected planar graph. Computation supports it by realizing the 823823 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 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.