Caro–Yuster conjecture on equating maximum degrees
Statement
For a graph on vertices, let be the minimum number of vertices whose deletion leaves an induced subgraph in which the maximum degree is attained by at least vertices, and let
Caro–Yuster conjecture. For any fixed integer ,
This conjecture concerns the number of vertex deletions needed to make the maximum degree non-unique with multiplicity at least . The paper presents it as an open problem; the exact value of the analogous quantity for minimum degrees is studied separately, while the maximum-degree problem remains unresolved.
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.