ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C\mathcal C be a class of graphs of bounded stretch-width. For an nn-vertex graph G∈CG\in\mathcal C, let the clique-width of GG be the minimum number of labels needed to construct GG using the clique-width operations. Logarithmic clique-width conjecture. There is a constant cc such that for every nn-vertex graph G∈CG\in\mathcal C, the clique-width of GG is at most clog⁡nc\log n. This would clarify whether bounded stretch-width generally implies essentially logarithmic clique-width; the paper provides a separating example with essentially logarithmic clique-width, but the general statement is posed as an open question.

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.