ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and, for k≥2k\geq 2, let fk(G)f_k(G) be the minimum number of vertices that must be deleted to obtain an induced subgraph with at least kk vertices attaining its maximum degree, or with fewer than kk vertices. Define

g(Δ,k)=max⁡{fk(G):Δ(G)≤Δ}.g(\Delta,k)=\max\{f_k(G):\Delta(G)\leq\Delta\}.

Bounded-degree conjecture. For every k≥2k\geq 2 there is a constant g(k)g(k) such that

g(Δ,k)≤g(k)Δ.g(\Delta,k)\leq g(k)\sqrt{\Delta}.

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 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.