ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a weighted web be a directed graph with vertex sets AA and BB and vertex capacities, and call it loose when it satisfies the looseness condition defined in the paper. A loose weighted web is linkable when the paper's specified family of vertex-disjoint paths or equivalent web-flow structure exists.

Loose weighted-web conjecture. A loose weighted web is linkable.

This is a reformulation of the main vertex version of the Max-Flow Min-Cut conjecture using the paper's wave-combination machinery. The excerpt does not provide enough information to identify the exact definition of looseness or linkability, so the formulation and its precise resolved status should be checked against the full paper.

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.