ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a planar self-dual graph without cut vertex, and let nn be an odd natural number. The spanning-tree characterization conjecture for planar self-dual graphs. Then nn is the number of spanning trees in GG if and only if nn is the sum of two squares and n≠1, 9, 49n\ne 1,\,9,\,49.

This is presented as a graph-theoretic strengthening of the preceding conjecture, extending the characterization from alternating achiral knots to spanning trees of planar self-dual graphs without cut vertices. The source gives no evidence of resolution, so it 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.