ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG on nn vertices, let fk(G)f_k(G) be the minimum number of vertices whose deletion leaves an induced subgraph in which the maximum degree is attained by at least kk vertices, and let

fk(n)=max⁡∣V(G)∣=nfk(G).f_k(n)=\max_{|V(G)|=n} f_k(G).

Caro–Yuster conjecture. For any fixed integer k≥2k\geq2,

fk(n)=Θ(n).f_k(n)=\Theta(\sqrt{n}).

This conjecture concerns the number of vertex deletions needed to make the maximum degree non-unique with multiplicity at least kk. 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 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.