ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A family of finite graphs is considered, and c1(F)c_1(\mathcal F) denotes the supremum of c1(G)c_1(G) over graphs GG in F\mathcal F, where c1(G)c_1(G) is the multi-commodity max-flow/min-cut gap for GG. A graph family forbids a minor if there is a graph that is not a minor of any member of the family.

Gupta–Newman–Rabinovich–Sinclair conjecture. For every family of finite graphs F\mathcal F, one has

c1(F)<∞c_1(\mathcal F)<\infty

if and only if F\mathcal F forbids some minor.

This conjecture characterizes precisely the graph families with uniformly bounded multi-commodity max-flow/min-cut gap, equivalently bounded distortion into distributions over trees. The supplied text does not state whether it has been resolved.

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.