The complete-graph product recurrence order conjecture
Statement
Let be the complete graph on vertices, let be the path graph on vertices, and consider the spanning-tree recurrence for the graph product . Complete-graph product recurrence order conjecture. The recurrence for the graph has order . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.