ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KkK_k be the complete graph on kk vertices, let PnP_n be the path graph on nn vertices, and consider the spanning-tree recurrence for the graph product Kk×PnK_k\times P_n. Complete-graph product recurrence order conjecture. The recurrence for the graph Kk×PnK_k\times P_n has order kk. This predicts an exact recurrence order for spanning-tree counts of complete-graph products with paths; 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.