Component spanning trees avoiding any prescribed label
Statement
Let be the graph whose components have labeled edges, and let be a label of a component . A component spanning tree of is a spanning tree using vertices of and edges of the component. Label-avoiding spanning-tree conjecture. For each component in , with , and for each label of , there exists a component spanning tree of containing no edge with label . This assertion would provide the nearly spanning trees needed by the proposed snake construction, but the source does not report a proof for general .
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.