Lower-bound conjecture for spanning trees containing a forest in complete tripartite graphs
Statement
Let and be the partite sets of the complete tripartite graph , where for . Let be a spanning forest in with components . Write and for and . The lower-bound conjecture. The number of spanning trees of containing all edges of satisfies
This conjecture seeks a general lower bound for the number of spanning trees containing a prescribed spanning forest in a complete tripartite graph; its status is not resolved in the supplied source material.
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.