The three-tree separation conjecture for bounded-degree trees
Statement
For integers , let 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 and maximum degree at most . Three-tree separation conjecture.
This conjecture extends the known formulas and , and agrees with the proved value . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.