The spanning-tree characterization conjecture for planar self-dual graphs
Statement
Let be a planar self-dual graph without cut vertex, and let be an odd natural number. The spanning-tree characterization conjecture for planar self-dual graphs. Then is the number of spanning trees in if and only if is the sum of two squares and .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.