Forest maximum-degree repetition conjecture
Statement
Let be a forest on vertices, and let denote the minimum number of vertices that must be deleted to obtain an induced subgraph with at least two vertices attaining its maximum degree, or with fewer than two vertices. Forest conjecture. If
then , and this bound is sharp. This conjecture concerns the extremal value of the deletion parameter for forests; the supplied text does not establish it, so its resolution 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.