ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices with minimum degree δ\delta. For a graph FF, let m(F)m(F) denote the maximum number of vertices having the same degree in FF. Bounded repeated-degree conjecture. GG contains a spanning subgraph HH satisfying

m(H)≤nδ+1+2.m(H)\leq \frac{n}{\delta+1}+2.

This is the second conjecture on spanning irregular subgraphs in the paper. The authors state that it remains open and establish asymptotic and universal weaker bounds.

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.