Treewidth-connectivity partition conjecture for graphs
Statement
Let be a graph, and let be an integer such that has treewidth at most and connectivity at least . A vertex set inducing a graph of treewidth at most and connectivity at least is denoted by , and an independent set is denoted by . Treewidth-connectivity partition conjecture. The vertices of can be partitioned into an induced graph of treewidth at most and connectivity at least , and an independent set . This is proposed as a generalization of a theorem for graphs of treewidth at most ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.