ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers r≥2r\geq 2, let f(r,3)f(r,3) denote the limiting maximum proportion of vertices that can be guaranteed in each of two disjoint subsets separated by a cut vector for any three trees with a common vertex set labeled by [n][n] and maximum degree at most rr. Three-tree separation conjecture.

f(r,3)=r−1r3f(r,3)=\frac{r-1}{r^3}

This conjecture extends the known formulas f(r,1)=1/rf(r,1)=1/r and f(r,2)=1/(2r)f(r,2)=1/(2r), and agrees with the proved value f(3,3)=2/27f(3,3)=2/27. The general case for three trees remains open.

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.