ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For fixed dd, let β(n)=o(n)\beta(n)=o(n) be a function, and let Gd,β′\mathcal G'_{d,\beta} be the class of graphs GG whose degeneracy is at most dd and whose bandwidth is at most β(∣G∣)\beta(|G|). A graph class is always-good when all sufficiently large members are HH-good for every graph HH. The degeneracy-bandwidth conjecture. For each fixed dd and each function β(n)=o(n)\beta(n)=o(n), the class Gd,β′\mathcal G'_{d,\beta} is always-good. This is proposed as a weakening of a bounded-maximum-degree hypothesis; the source places it among open problems.

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.