Exponential non-isomorphism conjecture for spanning trees of regular graphs
Statement
Let be integers, and let be a connected -vertex -regular graph. Write for the set of isomorphism classes of spanning trees of . Exponential spanning-tree conjecture. There exists a universal constant depending only on such that
The paper proves an analogous result for sufficiently large degree and asks whether the threshold can be reduced to ; the conjecture asserts this bound for every .
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.