ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H\mathcal{H} be a minor-closed graph class. For a graph GG, let idH(G)\mathsf{id}_{\mathcal{H}}(G) denote the minimum number of edge identifications needed to transform GG into a graph in H\mathcal{H}, and let ecH(G)\mathsf{ec}_{\mathcal{H}}(G) denote the minimum number of edge contractions needed to transform GG into a graph in H\mathcal{H}. Functional monotonicity conjecture. There is a function fH:N→Nf_{\mathcal{H}}:\mathbb{N}\to\mathbb{N} such that for every graph GG,

ecH(G)≤fH(idH(G)).\mathsf{ec}_{\mathcal{H}}(G)\leq f_{\mathcal{H}}(\mathsf{id}_{\mathcal{H}}(G)).

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 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.