ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Gk(n)G_k(n) denote the grid graph considered in the paper, with the recurrence for its spanning-tree counts taken with respect to nn. Grid recurrence order conjecture. The recurrence for the grid graph Gk(n)G_k(n) has order 2k−12^{k-1}. 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 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.