The order conjecture for spanning-tree recurrences of grid graphs
Statement
Let denote the grid graph considered in the paper, with the recurrence for its spanning-tree counts taken with respect to . Grid recurrence order conjecture. The recurrence for the grid graph has order . This predicts an exact recurrence order for the spanning-tree sequence of the grid graphs; the source provides no evidence of resolution.
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.