Degeneracy-bandwidth always-goodness conjecture
Statement
For fixed , let be a function, and let be the class of graphs whose degeneracy is at most and whose bandwidth is at most . A graph class is always-good when all sufficiently large members are -good for every graph . The degeneracy-bandwidth conjecture. For each fixed and each function , the class 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.