ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G^2n+1\hat{\mathcal{G}}_{2n+1} be the graph whose components AA have labeled edges, and let η\eta be a label of a component AA. A component spanning tree of AA is a spanning tree using vertices of AA and edges of the component. Label-avoiding spanning-tree conjecture. For each component AA in G^2n+1\hat{\mathcal{G}}_{2n+1}, with n≥3n\geq 3, and for each label η\eta of AA, there exists a component spanning tree of AA containing no edge with label η\eta. This assertion would provide the nearly spanning trees needed by the proposed snake construction, but the source does not report a proof for general nn.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.