ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C\mathcal C and B\mathcal B be classes of graphs closed under taking induced subgraphs. Suppose that every 2-connected graph in C\mathcal C is either in B\mathcal B or has a proper 2-separator or a proper P3P_3-separator. Assume that, for some constant aa, every graph in B\mathcal B has cliquewidth at most aa.

Cliquewidth preservation conjecture. There is a function ff such that every graph in C\mathcal C has cliquewidth at most f(a)f(a).

This conjecture asks whether decomposing graphs along proper 2-separators and proper P3P_3-separators preserves bounded cliquewidth. Its status is not resolved in the supplied source.

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.