ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with maximum degree Δ\Delta. For a subgraph H⊆GH\subseteq G, vertices of degree Δ(H)\Delta(H) are vertices attaining the maximum degree of HH.

Caro–Lauri–Zarb conjecture. For every k≥2k\geq 2 there is a constant g(k)g(k) such that one can remove at most g(k)Δg(k)\sqrt{\Delta} vertices from GG so that the remaining subgraph H⊆GH\subseteq G has at least kk vertices of degree Δ(H)\Delta(H).

This conjecture generalizes the problem of finding a large induced subgraph whose maximum degree is attained by at least kk 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.