Functional monotonicity conjecture for contraction distance to minor-closed classes
Statement
Let be a minor-closed graph class. For a graph , let denote the minimum number of edge identifications needed to transform into a graph in , and let denote the minimum number of edge contractions needed to transform into a graph in . Functional monotonicity conjecture. There is a function such that for every graph ,
This would extend the displayed polynomial relationship proved in the paper for forests to every minor-closed class, showing that edge-contraction distance is bounded as a function of edge-identification distance; no resolution is given.
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.