ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture Let GG be a graph and let T⊆V(G)T\subseteq V(G) such that for any pair u,v∈Tu,v\in T there are 2k2k edge-disjoint paths from uu to vv in GG. Then GG contains kk edge-disjoint trees, each of which contains TT.

Record

Added
Links

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.