The edge-deletion monotonicity conjecture for Markov width
Statement
Let be a graph, let be obtained from by deleting an edge, and let and denote their Markov widths.
Edge-deletion monotonicity conjecture. If is obtained from by deleting an edge, then
The statement extends the proved minor monotonicity result for vertex deletion and edge contraction. The authors state that it agrees with their data but that they have been unable to prove it.
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.