Caro–Lauri–Zarb conjecture on induced subgraphs with repeated maximum degree
Statement
Let be a graph with maximum degree . For a subgraph , vertices of degree are vertices attaining the maximum degree of .
Caro–Lauri–Zarb conjecture. For every there is a constant such that one can remove at most vertices from so that the remaining subgraph has at least vertices of degree .
This conjecture generalizes the problem of finding a large induced subgraph whose maximum degree is attained by at least vertices. The paper proves a related result with an additive constant in the degree condition, but the supplied text does not state that this conjecture itself is resolved.
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.