ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let kk be an integer such that GG has treewidth at most kk and connectivity at least kk. A vertex set inducing a graph of treewidth at most k−1k-1 and connectivity at least k−1k-1 is denoted by T\mathcal{T}, and an independent set is denoted by I\mathcal{I}. Treewidth-connectivity partition conjecture. The vertices of GG can be partitioned into an induced graph T\mathcal{T} of treewidth at most k−1k-1 and connectivity at least k−1k-1, and an independent set I\mathcal{I}. This is proposed as a generalization of a theorem for graphs of treewidth at most 22; the source leaves it as a belief rather than an established result.

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.