The power-of-two factor degree conjecture for spanning-tree transfer matrices
Statement
Let be a graph with vertices, let , and let be the integer matrix from the theorem such that , where is the number of spanning trees in . Power-of-two factor degree conjecture. The characteristic polynomial factors over the integers into monomials whose degree is always a power of . This conjecture concerns the algebraic structure of the transfer matrix governing spanning trees in 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.