Canonical sequence conjecture for tangle-distinguishing tree-decompositions
Statement
Let be a graph, and let denote the relevant maximum tangle order. A canonical sequence of tree-decompositions is a sequence for , where each is a tree-decomposition of , and where refinement and torsos are understood in the usual sense. A part is inessential at stage if it does not contain an -tangle.
Canonical sequence conjecture. For every graph there exists a canonical sequence of tree-decompositions for of such that:
- distinguishes every -tangle in for each ;
- distinguishes the set of maximal tangles in ;
- refines for each ;
- the torso of every inessential part in has branch-width .
This is presented as the strongest form of a positive answer to the preceding question about bounding the branch-width of inessential parts. The preceding theorem establishes the existence of a canonical nested set distinguishing all tangles, but the claimed simultaneous sequence, refinement property, and branch-width bound remain conjectural.
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.