Maximum-degree boundedness conjecture for equating degrees
Statement
Let be a graph and, for , let be the minimum number of vertices that must be deleted to obtain an induced subgraph with at least vertices attaining its maximum degree, or with fewer than vertices. Define
Bounded-degree conjecture. For every there is a constant such that
The source states that this conjecture would imply the Caro–Yuster conjecture. It is presented as an unresolved problem, and no proof or disproof is supplied.
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.